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 | 13969 |
31.47%
|
3072 |
75.33%
|
|
|
|
526 - String Distance and Transform Process | 13893 |
26.44%
|
2770 |
71.66%
|
|
|
|
531 - Compromise | 21835 |
30.36%
|
5147 |
76.59%
|
|
|
1207 - AGTC | 3395 |
47.92%
|
1041 |
93.66%
|
|
|
|
10066 - The Twin Towers | 24554 |
47.26%
|
8465 |
90.31%
|
|
|
|
10100 - Longest Match | 20576 |
22.07%
|
3756 |
72.10%
|
|
|
|
10192 - Vacation | 34273 |
36.57%
|
8568 |
89.05%
|
|
|
|
10405 - Longest Common Subsequence | 63453 |
37.15%
|
14771 |
88.70%
|
|
|
|
10635 - Prince and Princess | 17585 |
36.72%
|
3389 |
81.47%
|
|
|
|
10739 - String to Palindrome | 8276 |
63.57%
|
3062 |
95.26%
|
|
| << Start < Prev 1 Next > End >> | ||
| Display # | Results 1 - 10 of 10 | |