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 | 13972 |
31.48%
|
3073 |
75.37%
|
|
|
|
526 - String Distance and Transform Process | 13906 |
26.43%
|
2772 |
71.65%
|
|
|
|
531 - Compromise | 21842 |
30.36%
|
5148 |
76.59%
|
|
|
1207 - AGTC | 3408 |
47.92%
|
1041 |
93.66%
|
|
|
|
10066 - The Twin Towers | 24556 |
47.26%
|
8466 |
90.31%
|
|
|
|
10100 - Longest Match | 20602 |
22.08%
|
3757 |
72.11%
|
|
|
|
10192 - Vacation | 34345 |
36.54%
|
8572 |
89.05%
|
|
|
|
10405 - Longest Common Subsequence | 63474 |
37.15%
|
14773 |
88.70%
|
|
|
|
10635 - Prince and Princess | 17604 |
36.71%
|
3390 |
81.47%
|
|
|
|
10739 - String to Palindrome | 8336 |
63.40%
|
3063 |
95.27%
|
|
| << Start < Prev 1 Next > End >> | ||
| Display # | Results 1 - 10 of 10 | |