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 | 4602 |
27.94%
|
958 |
66.70%
|
|
|
10453 - Make Palindrome | 9970 |
39.54%
|
2143 |
84.93%
|
|
|
|
10617 - Again Palindrome | 7384 |
48.05%
|
2086 |
93.19%
|
|
|
|
11022 - String Factoring | 3146 |
65.80%
|
1370 |
92.55%
|
|
|
|
11151 - Longest Palindrome | 22955 |
30.87%
|
4668 |
83.48%
|
|
|
|
11258 - String Partition | 5481 |
54.50%
|
1643 |
92.64%
|
|
|
|
11552 - Fewest Flops | 4155 |
40.94%
|
824 |
84.83%
|
|
| << Start < Prev 1 Next > End >> | ||
| Display # | Results 1 - 7 of 7 | |