Our Patreons
Diamond Sponsors
Steven & Felix Halim
Reinardus Pradhitya
Gold Sponsors
--- YOUR NAME HERE ----
Silver Sponsors
--- YOUR NAME HERE ----
Bronze Sponsors
Christianto Handojo
Krzysztof Adamek
Fatima Broom
Browse Problems
Root :: Competitive Programming 3: The New Lower Bound of Programming Contests (Steven & Felix Halim) :: String Processing :: String Processing with Dynamic Programming :: Classic
| Title | Total Submissions / Solving % | Total Users / Solving % | ||||
|
|
164 - String Computer | 14384 |
31.53%
|
3108 |
75.39%
|
|
|
|
526 - String Distance and Transform Process | 14785 |
26.24%
|
2829 |
71.58%
|
|
|
|
531 - Compromise | 22292 |
30.48%
|
5181 |
76.59%
|
|
|
|
1207 - AGTC | 5483 |
43.08%
|
1118 |
93.56%
|
|
|
|
10066 - The Twin Towers | 25403 |
47.27%
|
8569 |
90.31%
|
|
|
|
10100 - Longest Match | 21227 |
21.92%
|
3820 |
71.99%
|
|
|
|
10192 - Vacation | 36492 |
36.19%
|
8731 |
88.97%
|
|
|
|
10405 - Longest Common Subsequence | 68680 |
37.71%
|
15150 |
88.76%
|
|
|
|
10635 - Prince and Princess | 18192 |
36.79%
|
3477 |
81.71%
|
|
|
|
10739 - String to Palindrome | 9569 |
63.09%
|
3161 |
95.29%
|
|
| << Start < Prev 1 Next > End >> | ||
| Display # | Results 1 - 10 of 10 | |
Browse Problems 

