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 | 4676 |
28.27%
|
973 |
66.70%
|
|
|
10453 - Make Palindrome | 10737 |
39.78%
|
2171 |
84.89%
|
|
|
|
10617 - Again Palindrome | 7964 |
47.60%
|
2137 |
92.98%
|
|
|
|
11022 - String Factoring | 3511 |
66.05%
|
1484 |
92.79%
|
|
|
|
11151 - Longest Palindrome | 23779 |
30.80%
|
4732 |
83.26%
|
|
|
|
11258 - String Partition | 5889 |
55.22%
|
1683 |
92.69%
|
|
|
|
11552 - Fewest Flops | 4275 |
40.82%
|
839 |
85.10%
|
|
| << Start < Prev 1 Next > End >> | ||
| Display # | Results 1 - 7 of 7 | |