Browse Problems 
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
Contribute
Bitcoin:
1ojudgeapLUjJcnUm
ze67a4w3TJ6WnPxo
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 | 14383 |
31.52%
|
3107 |
75.38%
|
|
|
|
526 - String Distance and Transform Process | 14771 |
26.20%
|
2828 |
71.57%
|
|
|
|
531 - Compromise | 22273 |
30.45%
|
5181 |
76.59%
|
|
|
1207 - AGTC | 5094 |
41.30%
|
1103 |
93.56%
|
|
|
|
10066 - The Twin Towers | 25360 |
47.22%
|
8563 |
90.31%
|
|
|
|
10100 - Longest Match | 21185 |
21.92%
|
3810 |
71.99%
|
|
|
|
10192 - Vacation | 36373 |
36.21%
|
8711 |
88.96%
|
|
|
|
10405 - Longest Common Subsequence | 68528 |
37.67%
|
15133 |
88.75%
|
|
|
|
10635 - Prince and Princess | 18184 |
36.77%
|
3477 |
81.71%
|
|
|
|
10739 - String to Palindrome | 9479 |
63.09%
|
3152 |
95.27%
|
|
| << Start < Prev 1 Next > End >> | ||
| Display # | Results 1 - 10 of 10 | |