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 | 4702 |
28.33%
|
980 |
66.94%
|
|
|
10453 - Make Palindrome | 10968 |
39.88%
|
2187 |
84.87%
|
|
|
|
10617 - Again Palindrome | 8098 |
47.62%
|
2161 |
93.01%
|
|
|
|
11022 - String Factoring | 3597 |
66.19%
|
1517 |
92.95%
|
|
|
|
11151 - Longest Palindrome | 24188 |
30.54%
|
4740 |
83.23%
|
|
|
|
11258 - String Partition | 6073 |
55.82%
|
1697 |
92.69%
|
|
|
|
11552 - Fewest Flops | 4281 |
40.83%
|
842 |
85.04%
|
|
| << Start < Prev 1 Next > End >> | ||
| Display # | Results 1 - 7 of 7 | |