DSA Level 2 Data Structures Hashmap and Heaps Longest Substring With At Most Two Distinct Characters

Longest Substring With At Most Two Distinct Characters

medium

Hashmap and Heaps

Question Solve Solutions

Given a string s, return the length of the longest substring that contains at most two distinct characters.

Input Format

Input is managed for u

Output Format

Output is managed for u.

Constraints

1. 1 &lt;= s.length &lt;= 105
2. s consists of English letters.

Notice

.

Example

Input

eceba

Output

Random Pick With Blacklist

A Simple Fraction

Related Questions

easy Double Pair Array easy Subdomain Visit Count easy Group Anagrams easy Isomorphic Strings easy Valid Anagram easy Longest Subarray With Sum Divisible By K easy The Skyline Problem easy Word Pattern easy Number Of Employees Under Every Manager easy Find Itinerary From Tickets easy Check If An Array Can Be Divided Into Pairs Whose Sum Is Divisible By K easy Largest Subarray With Zero Sum easy Count Distinct Elements In Every Window Of Size K easy Largest Subarray With Contiguous Elements medium Count Of All Subarrays With Zero Sum hard Smallest Substring Of A String Containing All Characters Of Another String