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
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 | 13944 |
31.50%
|
3066 |
75.34%
|
||
526 - String Distance and Transform Process | 13862 |
26.45%
|
2770 |
71.66%
|
||
531 - Compromise | 21834 |
30.36%
|
5146 |
76.58%
|
||
1207 - AGTC | 3376 |
47.96%
|
1037 |
93.64%
|
||
10066 - The Twin Towers | 24393 |
47.21%
|
8455 |
90.30%
|
||
10100 - Longest Match | 20301 |
21.95%
|
3752 |
72.09%
|
||
10192 - Vacation | 33980 |
36.60%
|
8557 |
89.08%
|
||
10405 - Longest Common Subsequence | 62983 |
37.10%
|
14741 |
88.72%
|
||
10635 - Prince and Princess | 17555 |
36.67%
|
3378 |
81.41%
|
||
10739 - String to Palindrome | 8197 |
63.55%
|
3057 |
95.26%
|
<< Start < Prev 1 Next > End >> | ||
Display # | Results 1 - 10 of 10 |