DSA
Max-heap on character frequency. Time O(n + d log d), Space O(d) where d = distinct characters.
Covers: Brute Force O(n²), Sliding Window O(n). Classic premium sliding-window problem using a character frequency map.