filmov
tv
Solution : Longest substring with K distinct characters (medium)

Показать описание
Given a string, find the length of the longest substring in it with no more than K distinct characters.
You can assume that K is less than or equal to the length of the given string.
You can assume that K is less than or equal to the length of the given string.