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 | 4704 |
28.32%
|
982 |
66.80%
|
|
|
10453 - Make Palindrome | 11123 |
40.12%
|
2196 |
84.88%
|
|
|
|
10617 - Again Palindrome | 8166 |
47.55%
|
2170 |
92.90%
|
|
|
|
11022 - String Factoring | 3617 |
66.13%
|
1524 |
92.91%
|
|
|
|
11151 - Longest Palindrome | 24246 |
30.55%
|
4743 |
83.22%
|
|
|
|
11258 - String Partition | 6094 |
55.92%
|
1701 |
92.65%
|
|
|
|
11552 - Fewest Flops | 4375 |
41.07%
|
844 |
84.95%
|
|
| << Start < Prev 1 Next > End >> | ||
| Display # | Results 1 - 7 of 7 | |