Sort Characters by Frequency
Beginner
Return a string with the characters of s grouped together, ordered by how often they appear: the most frequent character first, each character repeated as many times as it occurs. If two characters appear equally often, the smaller character (in alphabetical order) comes first.
Examples
Example 1
Input:
sort_by_frequency('tree')
Output:
'eert'
e appears twice, r and t once: eert.
Example 2
Input:
sort_by_frequency('cccaaa')
Output:
'aaaccc'
a and c tie, so a comes first.
Constraints
0 <= len(s) <= 3 * 10**5scontains letters and digits.
Theory
Go to TheoryKeywords
dsa-sheetstringsstring-basics
Run your code to see results
No results yet
Run your code to check it against the examples, or submit to run every test.