Need Help solve this problem

Правка en1, от jarvis_yash, 2023-11-07 16:01:38

given string which only contains 'J' , 'L' , 'R' as character

find smallest substring of size >=2 which follows following condition no.of J is strictly greater than L no.of J is strickly greater than R

2<= N: length of string <=1e6

Теги #strings, substring

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en1 Английский jarvis_yash 2023-11-07 16:01:38 267 Initial revision (published)