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 | 14001 |
31.48%
|
3074 |
75.37%
|
|
|
|
526 - String Distance and Transform Process | 13923 |
26.42%
|
2773 |
71.66%
|
|
|
|
531 - Compromise | 21863 |
30.35%
|
5151 |
76.59%
|
|
|
1207 - AGTC | 3413 |
47.96%
|
1044 |
93.68%
|
|
|
|
10066 - The Twin Towers | 24577 |
47.27%
|
8474 |
90.32%
|
|
|
|
10100 - Longest Match | 20608 |
22.08%
|
3760 |
72.13%
|
|
|
|
10192 - Vacation | 34460 |
36.51%
|
8586 |
89.02%
|
|
|
|
10405 - Longest Common Subsequence | 63700 |
37.14%
|
14785 |
88.70%
|
|
|
|
10635 - Prince and Princess | 17703 |
36.71%
|
3399 |
81.49%
|
|
|
|
10739 - String to Palindrome | 8388 |
63.42%
|
3066 |
95.27%
|
|
| << Start < Prev 1 Next > End >> | ||
| Display # | Results 1 - 10 of 10 | |