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 | 14384 |
31.53%
|
3108 |
75.39%
|
|
|
|
526 - String Distance and Transform Process | 14772 |
26.20%
|
2829 |
71.58%
|
|
|
|
531 - Compromise | 22286 |
30.46%
|
5181 |
76.59%
|
|
|
1207 - AGTC | 5280 |
41.61%
|
1117 |
93.64%
|
|
|
|
10066 - The Twin Towers | 25388 |
47.25%
|
8568 |
90.31%
|
|
|
|
10100 - Longest Match | 21217 |
21.92%
|
3820 |
71.96%
|
|
|
|
10192 - Vacation | 36477 |
36.18%
|
8728 |
88.94%
|
|
|
|
10405 - Longest Common Subsequence | 68619 |
37.69%
|
15147 |
88.76%
|
|
|
|
10635 - Prince and Princess | 18191 |
36.78%
|
3477 |
81.71%
|
|
|
|
10739 - String to Palindrome | 9558 |
63.08%
|
3160 |
95.28%
|
|
| << Start < Prev 1 Next > End >> | ||
| Display # | Results 1 - 10 of 10 | |