Leetcode 340. Longest Substring with At Most K Distinct Characters

Given a string and an integer K, find the length of the longest substring that contains at most K distinct characters. This is typically solved by maintaining a variable-size sliding window and a character frequency map to expand and shrink while keeping the distinct-count constraint.