Longest Substring with At Most Two Distinct Characters
You are given a string s, return the length of the longest substring that contains at most two distinct characters.
Note: A substring is a contiguous non-empty sequence of characters within a string.
Example 1:
Input: s = "eceba"
Output: 3Explanation: The substring is "ece" which its length is 3.
Example 2:
Input: s = "ccaabbb"
Output: 5Explanation: The substring is "aabbb" which its length is 5.
Constraints:
0 <= s.length <= 1,00,000sconsists of English letters.