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 | 14087 |
31.50%
|
3090 |
75.44%
|
|
|
|
526 - String Distance and Transform Process | 14476 |
26.14%
|
2805 |
71.44%
|
|
|
|
531 - Compromise | 22091 |
30.40%
|
5164 |
76.55%
|
|
|
1207 - AGTC | 3640 |
47.28%
|
1060 |
93.58%
|
|
|
|
10066 - The Twin Towers | 25033 |
47.24%
|
8532 |
90.31%
|
|
|
|
10100 - Longest Match | 20863 |
22.05%
|
3794 |
72.03%
|
|
|
|
10192 - Vacation | 35754 |
36.27%
|
8659 |
88.97%
|
|
|
|
10405 - Longest Common Subsequence | 66272 |
37.26%
|
14927 |
88.71%
|
|
|
|
10635 - Prince and Princess | 17994 |
36.75%
|
3451 |
81.63%
|
|
|
|
10739 - String to Palindrome | 8980 |
63.18%
|
3102 |
95.23%
|
|
| << Start < Prev 1 Next > End >> | ||
| Display # | Results 1 - 10 of 10 | |