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 | 4784 |
28.51%
|
993 |
66.87%
|
|
|
10453 - Make Palindrome | 11585 |
40.75%
|
2225 |
84.94%
|
|
|
|
10617 - Again Palindrome | 8359 |
47.69%
|
2201 |
92.87%
|
|
|
|
11022 - String Factoring | 3801 |
66.43%
|
1550 |
92.90%
|
|
|
|
11151 - Longest Palindrome | 24460 |
30.63%
|
4762 |
83.20%
|
|
|
|
11258 - String Partition | 6260 |
56.21%
|
1721 |
92.74%
|
|
|
|
11552 - Fewest Flops | 4386 |
41.09%
|
846 |
84.99%
|
|
| << Start < Prev 1 Next > End >> | ||
| Display # | Results 1 - 7 of 7 | |