jarvis_yash's blog

Need Help solve this problem
By jarvis_yash, history, 8 months ago, In English

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

  • Vote: I like it
  • -6
  • Vote: I do not like it

»
8 months ago, # |
  Vote: I like it 0 Vote: I do not like it

My window is sliding. :)

→ Reply
»
8 months ago, # |
  Vote: I like it 0 Vote: I do not like it

instead of writing this way, you can attach the problem link.

you can send the link here

→ Reply