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. ( )

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 =

occurence :

occ =

Solution Stats

45.53% Correct | 54.47% Incorrect
Last Solution submitted on Jan 30, 2024

Problem Comments

Solution Comments

Show comments

Problem Recent Solvers39

Suggested Problems

Problem Tags

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!