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 | 14347 |
31.54%
|
3102 |
75.44%
|
|
|
|
526 - String Distance and Transform Process | 14757 |
26.19%
|
2827 |
71.56%
|
|
|
|
531 - Compromise | 22267 |
30.44%
|
5178 |
76.57%
|
|
|
1207 - AGTC | 5088 |
41.25%
|
1101 |
93.55%
|
|
|
|
10066 - The Twin Towers | 25317 |
47.20%
|
8561 |
90.30%
|
|
|
|
10100 - Longest Match | 21139 |
21.94%
|
3805 |
71.98%
|
|
|
|
10192 - Vacation | 36319 |
36.21%
|
8706 |
88.95%
|
|
|
|
10405 - Longest Common Subsequence | 68268 |
37.65%
|
15109 |
88.75%
|
|
|
|
10635 - Prince and Princess | 18157 |
36.77%
|
3470 |
81.67%
|
|
|
|
10739 - String to Palindrome | 9413 |
63.14%
|
3146 |
95.26%
|
|
| << Start < Prev 1 Next > End >> | ||
| Display # | Results 1 - 10 of 10 | |