#####   ######  #####    ###    #   #  ###  #   #  ######
##  ##  ##      ##  ##  ## ##   #   #   #   #   #  ##
#####   ####    #####   #   #   #   #   #   #   #  ####
##  #   ##      ##      ## ##    # #    #    # #   ##
##   #  ######  ##       ###      #    ###    #    ######

$ curl repovive.com/roadmaps/fundamental-algorithms/sliding-window/longest-substring-with-k-distinct

░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░████████████████████████████████████████████████████████████████████████████████████████████████████

#####   ######  #####    ###    #   #  ###  #   #  ######
##  ##  ##      ##  ##  ## ##   #   #   #   #   #  ##
#####   ####    #####   #   #   #   #   #   #   #  ####
##  #   ##      ##      ## ##    # #    #    # #   ##
##   #  ######  ##       ###      #    ###    #    ######

$ curl repovive.com/roadmaps/fundamental-algorithms/sliding-window/longest-substring-with-k-distinct

Repovive

Longest Substring with K Distinct - Sliding Window | Fundamental Algorithms | Repovive

Repovive.

Fundamental Algorithms8 sections · 294 units2h total

Open in Course

Longest Substring with K Distinct

Generalization with at most k distinct characters.

Problem: Longest substring with at most $k$ distinct characters.

function lengthOfLongestSubstringKDistinct(s, k):
    charCount = empty map
    left = 0, maxLen = 0

    for right from 0 to s.length - 1:
        charCount[s[right]]++
        while charCount.size > k:
            charCount[s[left]]--
            if charCount[s[left]] == 0:
                charCount.remove(s[left])
            left++
        maxLen = max(maxLen, right - left + 1)
    return maxLen

Time: $O(n)$ . Space: $O(k)$ .