Browse Problems 
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 | 4605 |
27.95%
|
960 |
66.67%
|
|
|
10453 - Make Palindrome | 10166 |
39.19%
|
2143 |
84.93%
|
|
|
|
10617 - Again Palindrome | 7446 |
48.11%
|
2092 |
93.21%
|
|
|
|
11022 - String Factoring | 3172 |
65.86%
|
1378 |
92.60%
|
|
|
|
11151 - Longest Palindrome | 22995 |
30.86%
|
4675 |
83.42%
|
|
|
|
11258 - String Partition | 5576 |
54.63%
|
1647 |
92.59%
|
|
|
|
11552 - Fewest Flops | 4158 |
40.96%
|
826 |
84.87%
|
|
| << Start < Prev 1 Next > End >> | ||
| Display # | Results 1 - 7 of 7 | |