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 | 4694 |
28.27%
|
975 |
66.77%
|
|
|
10453 - Make Palindrome | 10870 |
39.84%
|
2179 |
84.95%
|
|
|
|
10617 - Again Palindrome | 8050 |
47.61%
|
2156 |
92.90%
|
|
|
|
11022 - String Factoring | 3553 |
66.23%
|
1504 |
92.82%
|
|
|
|
11151 - Longest Palindrome | 23868 |
30.82%
|
4739 |
83.25%
|
|
|
|
11258 - String Partition | 5984 |
55.45%
|
1694 |
92.68%
|
|
|
|
11552 - Fewest Flops | 4280 |
40.82%
|
841 |
85.02%
|
|
| << Start < Prev 1 Next > End >> | ||
| Display # | Results 1 - 7 of 7 | |