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 | 14483 |
26.13%
|
2806 |
71.42%
|
|
|
|
531 - Compromise | 22153 |
30.42%
|
5168 |
76.57%
|
|
|
1207 - AGTC | 5033 |
40.99%
|
1094 |
93.60%
|
|
|
|
10066 - The Twin Towers | 25146 |
47.20%
|
8541 |
90.32%
|
|
|
|
10100 - Longest Match | 20999 |
21.97%
|
3796 |
72.02%
|
|
|
|
10192 - Vacation | 35855 |
36.27%
|
8667 |
88.97%
|
|
|
|
10405 - Longest Common Subsequence | 66762 |
37.35%
|
14958 |
88.70%
|
|
|
|
10635 - Prince and Princess | 18035 |
36.76%
|
3457 |
81.63%
|
|
|
|
10739 - String to Palindrome | 9013 |
63.21%
|
3109 |
95.24%
|
|
| << Start < Prev 1 Next > End >> | ||
| Display # | Results 1 - 10 of 10 | |