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 | 4678 |
28.28%
|
974 |
66.74%
|
|
|
10453 - Make Palindrome | 10773 |
39.82%
|
2176 |
84.93%
|
|
|
|
10617 - Again Palindrome | 7999 |
47.64%
|
2143 |
93.00%
|
|
|
|
11022 - String Factoring | 3540 |
66.16%
|
1499 |
92.80%
|
|
|
|
11151 - Longest Palindrome | 23816 |
30.80%
|
4735 |
83.25%
|
|
|
|
11258 - String Partition | 5968 |
55.33%
|
1689 |
92.66%
|
|
|
|
11552 - Fewest Flops | 4278 |
40.79%
|
840 |
85.00%
|
|
| << Start < Prev 1 Next > End >> | ||
| Display # | Results 1 - 7 of 7 | |