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
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 | 4797 |
28.56%
|
995 |
67.14%
|
|
|
|
10453 - Make Palindrome | 11665 |
40.89%
|
2236 |
84.88%
|
|
|
|
10617 - Again Palindrome | 8397 |
47.77%
|
2209 |
92.85%
|
|
|
|
11022 - String Factoring | 3878 |
66.63%
|
1571 |
93.00%
|
|
|
|
11151 - Longest Palindrome | 24932 |
30.45%
|
4766 |
83.21%
|
|
|
|
11258 - String Partition | 6454 |
56.65%
|
1740 |
92.82%
|
|
|
|
11552 - Fewest Flops | 4393 |
41.13%
|
849 |
85.04%
|
|
| << Start < Prev 1 Next > End >> | ||
| Display # | Results 1 - 7 of 7 | |
Browse Problems 

