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 | 4785 |
28.53%
|
993 |
66.97%
|
|
|
10453 - Make Palindrome | 11604 |
40.79%
|
2227 |
84.96%
|
|
|
|
10617 - Again Palindrome | 8364 |
47.70%
|
2203 |
92.87%
|
|
|
|
11022 - String Factoring | 3816 |
66.46%
|
1555 |
92.93%
|
|
|
|
11151 - Longest Palindrome | 24467 |
30.63%
|
4763 |
83.20%
|
|
|
|
11258 - String Partition | 6279 |
56.25%
|
1722 |
92.74%
|
|
|
|
11552 - Fewest Flops | 4387 |
41.10%
|
847 |
85.01%
|
|
| << Start < Prev 1 Next > End >> | ||
| Display # | Results 1 - 7 of 7 | |