Skip to content

Practice Sort Characters By Frequency

Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.

Medium#451
LeetCode Problem

Sort Characters By Frequency

Hash TableStringSortingHeap (Priority Queue)Bucket SortCounting

Problem Statement

Given a string s, sort it in decreasing order based on the frequency of the characters. The frequency of a character is the number of times it appears in the string. Return the sorted string. If there are multiple answers, return any of them.

Source: Sort Characters By Frequency on LeetCode. Use the original task for its coding environment and submissions.

Examples

# Example 1

Input
s = "tree"
Output
"eert"

# Example 2

Input
s = "cccaaa"
Output
"aaaccc"

# Example 3

Input
s = "Aabb"
Output
"bbAa"

Constraints

1 <= s.length <= 5 * 10^5
s consists of uppercase and lowercase English letters and digits.

Related LeetCode Problems

Practice more problems similar to Sort Characters By Frequency.

3 Longest Substring Without Repeating Characters Medium12 Integer to Roman Medium13 Roman to Integer Easy17 Letter Combinations of a Phone Number Medium30 Substring with Concatenation of All Words Hard
← Previous Delete Node in a BSTNext → Minimum Number of Arrows to Burst Balloons

Review your practice with PhantomCodeAI

After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.

Start Free