problem340

README

< Previous 　　　　　　　　　　　　　　　　 Next >

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

Given a string, find the length of the longest substring T that contains at most k distinct characters.

Example 1:

Input: s = "eceba", k = 2
Output: 3
Explanation: T is "ece" which its length is 3.

Example 2:

Input: s = "aa", k = 1
Output: 2
Explanation: T is "aa" which its length is 2.

Related Topics

[Hash Table] [Two Pointers] [String] [Sliding Window]

Similar Questions

1. Longest Substring Without Repeating Characters (Medium)
2. Longest Substring with At Most Two Distinct Characters (Medium)
3. Longest Repeating Character Replacement (Medium)
4. Subarrays with K Different Integers (Hard)
5. Max Consecutive Ones III (Medium)