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 | 14318 |
31.53%
|
3093 |
75.43%
|
|
|
|
526 - String Distance and Transform Process | 14707 |
26.19%
|
2820 |
71.52%
|
|
|
|
531 - Compromise | 22234 |
30.42%
|
5173 |
76.55%
|
|
|
1207 - AGTC | 5082 |
41.26%
|
1101 |
93.55%
|
|
|
|
10066 - The Twin Towers | 25274 |
47.18%
|
8555 |
90.30%
|
|
|
|
10100 - Longest Match | 21132 |
21.92%
|
3803 |
71.97%
|
|
|
|
10192 - Vacation | 36209 |
36.22%
|
8696 |
88.95%
|
|
|
|
10405 - Longest Common Subsequence | 68011 |
37.59%
|
15079 |
88.75%
|
|
|
|
10635 - Prince and Princess | 18146 |
36.75%
|
3468 |
81.66%
|
|
|
|
10739 - String to Palindrome | 9300 |
63.22%
|
3137 |
95.25%
|
|
| << Start < Prev 1 Next > End >> | ||
| Display # | Results 1 - 10 of 10 | |