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 | 14070 |
31.49%
|
3085 |
75.40%
|
|
|
|
526 - String Distance and Transform Process | 14355 |
26.19%
|
2803 |
71.46%
|
|
|
|
531 - Compromise | 22087 |
30.39%
|
5162 |
76.54%
|
|
|
1207 - AGTC | 3623 |
47.36%
|
1059 |
93.58%
|
|
|
|
10066 - The Twin Towers | 24980 |
47.24%
|
8528 |
90.30%
|
|
|
|
10100 - Longest Match | 20788 |
22.09%
|
3792 |
72.05%
|
|
|
|
10192 - Vacation | 35566 |
36.28%
|
8642 |
88.97%
|
|
|
|
10405 - Longest Common Subsequence | 65704 |
37.20%
|
14904 |
88.72%
|
|
|
|
10635 - Prince and Princess | 17971 |
36.71%
|
3440 |
81.60%
|
|
|
|
10739 - String to Palindrome | 8934 |
63.15%
|
3093 |
95.22%
|
|
| << Start < Prev 1 Next > End >> | ||
| Display # | Results 1 - 10 of 10 | |