#Premium

DSA

340. Longest Substring with At Most K Distinct Characters

Covers: Brute Force O(n²), Sliding Window O(n). Classic premium sliding-window problem using a character frequency map.