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 | 4796 |
28.54%
|
995 |
67.14%
|
|
|
10453 - Make Palindrome | 11639 |
40.85%
|
2234 |
84.87%
|
|
|
|
10617 - Again Palindrome | 8389 |
47.76%
|
2208 |
92.84%
|
|
|
|
11022 - String Factoring | 3866 |
66.61%
|
1568 |
92.98%
|
|
|
|
11151 - Longest Palindrome | 24649 |
30.60%
|
4765 |
83.21%
|
|
|
|
11258 - String Partition | 6412 |
56.50%
|
1737 |
92.80%
|
|
|
|
11552 - Fewest Flops | 4393 |
41.13%
|
849 |
85.04%
|
|
| << Start < Prev 1 Next > End >> | ||
| Display # | Results 1 - 7 of 7 | |