Problem 1249. first step for Huffman Coding (easy)
Given a string, you must sort the characters by occurrence (from lowest to highest).
This step is necessary to generate a Huffman tree. ( http://en.wikipedia.org/wiki/Huffman_coding )
All characters must be taken into account. Capitals are not taken into account.
If two characters appear the same number of times, the order does not matter.
You will return two arrays:
the first comprising the characters sorted. the second comprising the number of occurrence of characters of the first array.
Example :
input :
input = 'aAabbC';
output :
characters :
cha =
c b a
occurence :
occ =
1 2 3
Solution Stats
Problem Comments
Solution Comments
Show commentsProblem Recent Solvers39
Suggested Problems
-
5634 Solvers
-
Omit columns averages from a matrix
579 Solvers
-
Project Euler: Problem 3, Largest prime factor
1348 Solvers
-
Get the elements of diagonal and antidiagonal for any m-by-n matrix
470 Solvers
-
809 Solvers
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!