Longest Substring with K Distinct | Dataford Interview Questions

Longest Substring with At Most K Distinct Characters (LeetCode 340).

Asked in the Coding round 2 stage. It was a 45-minute coding round; the candidate solved it.

Task

Given a string s and integer k, return the length of the longest substring containing at most k distinct characters. A substring must be contiguous.

Function: def length_of_longest_substring_k_distinct(s, k):

Return an integer. If s is empty or k is zero, return 0.

Constraints

0 <= len(s) <= 10^4
0 <= k <= 10^4
s contains printable ASCII characters

Function Signature

def length_of_longest_substring_k_distinct(s, k):

Your question is Longest Substring with K Distinct. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

Problem