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 | 4750 |
28.44%
|
984 |
66.87%
|
|
|
10453 - Make Palindrome | 11232 |
40.40%
|
2206 |
84.95%
|
|
|
|
10617 - Again Palindrome | 8179 |
47.61%
|
2174 |
92.92%
|
|
|
|
11022 - String Factoring | 3635 |
66.19%
|
1525 |
92.92%
|
|
|
|
11151 - Longest Palindrome | 24264 |
30.57%
|
4743 |
83.22%
|
|
|
|
11258 - String Partition | 6096 |
55.94%
|
1702 |
92.66%
|
|
|
|
11552 - Fewest Flops | 4378 |
41.07%
|
844 |
84.95%
|
|
| << Start < Prev 1 Next > End >> | ||
| Display # | Results 1 - 7 of 7 | |