Question on substring

Правка en1, от bootcoder, 2021-08-21 15:33:11

There is a string s of length n , we have to find the maximum length x such that all substrings L of length x has at most k distinct characters.

constraint- n<=10^5

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en1 Английский bootcoder 2021-08-21 15:33:11 196 Initial revision (published)