longest-substring-with-at-most-two-distinct-characters

< Previous 　　　　　　　　　　　　　　　　 Next >

159. Longest Substring with At Most Two Distinct Characters (Medium)

Given a string s , find the length of the longest substring t  that contains at most 2 distinct characters.

Example 1:

Input: "eceba"
Output: 3
Explanation: t is "ece" which its length is 3.

Example 2:

Input: "ccaabbb"
Output: 5
Explanation: t is "aabbb" which its length is 5.

Related Topics

[Hash Table] [String] [Sliding Window]

Similar Questions

1. Longest Substring Without Repeating Characters (Medium)
2. Sliding Window Maximum (Hard)
3. Longest Substring with At Most K Distinct Characters (Medium)
4. Subarrays with K Different Integers (Hard)