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 | 4786 |
28.54%
|
994 |
67.00%
|
|
|
10453 - Make Palindrome | 11621 |
40.80%
|
2229 |
84.97%
|
|
|
|
10617 - Again Palindrome | 8373 |
47.72%
|
2206 |
92.88%
|
|
|
|
11022 - String Factoring | 3823 |
66.49%
|
1559 |
92.94%
|
|
|
|
11151 - Longest Palindrome | 24494 |
30.62%
|
4764 |
83.21%
|
|
|
|
11258 - String Partition | 6282 |
56.27%
|
1723 |
92.75%
|
|
|
|
11552 - Fewest Flops | 4392 |
41.12%
|
848 |
85.02%
|
|
| << Start < Prev 1 Next > End >> | ||
| Display # | Results 1 - 7 of 7 | |