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 | 14338 |
31.55%
|
3101 |
75.43%
|
|
|
|
526 - String Distance and Transform Process | 14717 |
26.21%
|
2826 |
71.55%
|
|
|
|
531 - Compromise | 22251 |
30.45%
|
5176 |
76.58%
|
|
|
1207 - AGTC | 5088 |
41.25%
|
1101 |
93.55%
|
|
|
|
10066 - The Twin Towers | 25300 |
47.19%
|
8560 |
90.30%
|
|
|
|
10100 - Longest Match | 21138 |
21.93%
|
3805 |
71.98%
|
|
|
|
10192 - Vacation | 36281 |
36.21%
|
8703 |
88.96%
|
|
|
|
10405 - Longest Common Subsequence | 68208 |
37.63%
|
15106 |
88.74%
|
|
|
|
10635 - Prince and Princess | 18156 |
36.76%
|
3469 |
81.67%
|
|
|
|
10739 - String to Palindrome | 9369 |
63.18%
|
3143 |
95.26%
|
|
| << Start < Prev 1 Next > End >> | ||
| Display # | Results 1 - 10 of 10 | |