Search⌘ K
AI Features

Solution: Sort Characters By Frequency

Let's solve the Sort Characters By Frequency problem using the Heaps pattern.

Statement

Given a string s, reorder its characters so that characters with higher frequency appear before characters with lower frequencies.

All occurrences of the same character must be placed contiguously. If multiple characters have the same frequency, they may appear in any order.

Constraints:

  • 11 \leq s.length 5105\leq 5 \cdot 10^5 ...