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 | 14379 |
31.53%
|
3106 |
75.40%
|
|
|
|
526 - String Distance and Transform Process | 14771 |
26.20%
|
2828 |
71.57%
|
|
|
|
531 - Compromise | 22271 |
30.45%
|
5181 |
76.59%
|
|
|
1207 - AGTC | 5091 |
41.29%
|
1103 |
93.56%
|
|
|
|
10066 - The Twin Towers | 25324 |
47.21%
|
8563 |
90.31%
|
|
|
|
10100 - Longest Match | 21164 |
21.93%
|
3809 |
72.01%
|
|
|
|
10192 - Vacation | 36361 |
36.21%
|
8711 |
88.96%
|
|
|
|
10405 - Longest Common Subsequence | 68433 |
37.67%
|
15122 |
88.76%
|
|
|
|
10635 - Prince and Princess | 18178 |
36.78%
|
3476 |
81.70%
|
|
|
|
10739 - String to Palindrome | 9462 |
63.11%
|
3152 |
95.27%
|
|
| << Start < Prev 1 Next > End >> | ||
| Display # | Results 1 - 10 of 10 | |