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 :: Non Classic
| Title | Total Submissions / Solving % | Total Users / Solving % | ||||
|
257 - Palinwords | 4606 |
27.94%
|
961 |
66.60%
|
|
|
10453 - Make Palindrome | 10227 |
39.28%
|
2145 |
84.94%
|
|
|
|
10617 - Again Palindrome | 7511 |
48.01%
|
2099 |
93.09%
|
|
|
|
11022 - String Factoring | 3236 |
65.67%
|
1397 |
92.56%
|
|
|
|
11151 - Longest Palindrome | 23090 |
30.86%
|
4682 |
83.43%
|
|
|
|
11258 - String Partition | 5630 |
54.58%
|
1651 |
92.55%
|
|
|
|
11552 - Fewest Flops | 4169 |
40.99%
|
829 |
84.92%
|
|
| << Start < Prev 1 Next > End >> | ||
| Display # | Results 1 - 7 of 7 | |