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 | 4778 |
28.51%
|
991 |
66.90%
|
|
|
10453 - Make Palindrome | 11533 |
40.71%
|
2221 |
84.96%
|
|
|
|
10617 - Again Palindrome | 8331 |
47.69%
|
2199 |
92.86%
|
|
|
|
11022 - String Factoring | 3787 |
66.41%
|
1546 |
92.88%
|
|
|
|
11151 - Longest Palindrome | 24435 |
30.60%
|
4761 |
83.20%
|
|
|
|
11258 - String Partition | 6241 |
56.22%
|
1719 |
92.73%
|
|
|
|
11552 - Fewest Flops | 4385 |
41.07%
|
845 |
84.97%
|
|
| << Start < Prev 1 Next > End >> | ||
| Display # | Results 1 - 7 of 7 | |