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 | 14367 |
31.50%
|
3104 |
75.39%
|
|
|
|
526 - String Distance and Transform Process | 14768 |
26.19%
|
2827 |
71.56%
|
|
|
|
531 - Compromise | 22267 |
30.44%
|
5178 |
76.57%
|
|
|
1207 - AGTC | 5089 |
41.27%
|
1102 |
93.56%
|
|
|
|
10066 - The Twin Towers | 25319 |
47.20%
|
8561 |
90.30%
|
|
|
|
10100 - Longest Match | 21151 |
21.93%
|
3807 |
72.00%
|
|
|
|
10192 - Vacation | 36346 |
36.20%
|
8707 |
88.95%
|
|
|
|
10405 - Longest Common Subsequence | 68381 |
37.66%
|
15114 |
88.75%
|
|
|
|
10635 - Prince and Princess | 18164 |
36.78%
|
3474 |
81.69%
|
|
|
|
10739 - String to Palindrome | 9439 |
63.16%
|
3151 |
95.27%
|
|
| << Start < Prev 1 Next > End >> | ||
| Display # | Results 1 - 10 of 10 | |