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
Browse Problems
Root :: Competitive Programming: Increasing the Lower Bound of Programming Contests (Steven & Felix Halim) :: Chapter 6. String Processing :: String Processing with DP
Title | Total Submissions / Solving % | Total Users / Solving % | ||||
![]() |
164 - String Computer | 14001 |
31.48%
|
3074 |
75.37%
|
|
![]() |
531 - Compromise | 21863 |
30.35%
|
5151 |
76.59%
|
|
![]() |
10066 - The Twin Towers | 24577 |
47.27%
|
8474 |
90.32%
|
|
![]() |
10100 - Longest Match | 20608 |
22.08%
|
3760 |
72.13%
|
|
![]() |
10192 - Vacation | 34460 |
36.51%
|
8586 |
89.02%
|
|
![]() |
10405 - Longest Common Subsequence | 63700 |
37.14%
|
14785 |
88.70%
|
|
![]() |
10739 - String to Palindrome | 8388 |
63.42%
|
3066 |
95.27%
|
|
![]() |
11151 - Longest Palindrome | 23090 |
30.86%
|
4682 |
83.43%
|
<< Start < Prev 1 Next > End >> | ||
Display # | Results 1 - 8 of 8 |