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
№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 3843 |
2 | jiangly | 3705 |
3 | Benq | 3628 |
4 | orzdevinwang | 3571 |
5 | Geothermal | 3569 |
5 | cnnfls_csy | 3569 |
7 | jqdai0815 | 3530 |
8 | ecnerwala | 3499 |
9 | gyh20 | 3447 |
10 | Rebelz | 3409 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | maomao90 | 171 |
2 | awoo | 163 |
3 | adamant | 162 |
4 | TheScrasse | 158 |
5 | nor | 153 |
5 | maroonrk | 153 |
7 | -is-this-fft- | 152 |
8 | Petr | 146 |
9 | orz | 145 |
10 | pajenegod | 144 |
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
Название |
---|
My window is sliding. :)
instead of writing this way, you can attach the problem link.
you can send the link here
I do not have link it was asked in placement test