Given a string s, find the length of the longest substring that contains at most 2 distinct characters.
Constraints
n ≤ 10,000 where n is the length of s.https://binarysearch.com/problems/Longest-Substring-with-2-Distinct-Characters
Input
abccbOutput
4Explanation
"bccb" is the longest substring with at most 2 distinct characters.
Given a list of integers nums, remove numbers that appear multiple times in the list, while maintaining order of the appearance in the original list.
Given a list of integers nums and an integer k, return whether there are four distinct elements in the list that add up to k.
You are given a list of integers nums and an integer target. In one operation we can remove any two numbers in nums if the pair sums to target. Return the ma...
Given a list of integers nums and an integer k, determine if there are three distinct elements in the list that add up to k.
Leave a comment