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 | 13946 |
31.49%
|
3067 |
75.32%
|
|
|
|
526 - String Distance and Transform Process | 13888 |
26.44%
|
2770 |
71.66%
|
|
|
|
531 - Compromise | 21834 |
30.36%
|
5146 |
76.58%
|
|
|
1207 - AGTC | 3380 |
47.93%
|
1038 |
93.64%
|
|
|
|
10066 - The Twin Towers | 24459 |
47.22%
|
8458 |
90.31%
|
|
|
|
10100 - Longest Match | 20349 |
21.98%
|
3753 |
72.10%
|
|
|
|
10192 - Vacation | 34042 |
36.59%
|
8559 |
89.08%
|
|
|
|
10405 - Longest Common Subsequence | 63205 |
37.08%
|
14751 |
88.69%
|
|
|
|
10635 - Prince and Princess | 17567 |
36.69%
|
3380 |
81.42%
|
|
|
|
10739 - String to Palindrome | 8204 |
63.57%
|
3058 |
95.26%
|
|
| << Start < Prev 1 Next > End >> | ||
| Display # | Results 1 - 10 of 10 | |