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 :: Classic
| Title | Total Submissions / Solving % | Total Users / Solving % | ||||
|
164 - String Computer | 14071 |
31.50%
|
3085 |
75.40%
|
|
|
|
526 - String Distance and Transform Process | 14366 |
26.18%
|
2804 |
71.43%
|
|
|
|
531 - Compromise | 22089 |
30.40%
|
5163 |
76.54%
|
|
|
1207 - AGTC | 3634 |
47.28%
|
1059 |
93.58%
|
|
|
|
10066 - The Twin Towers | 25004 |
47.24%
|
8530 |
90.30%
|
|
|
|
10100 - Longest Match | 20805 |
22.07%
|
3792 |
72.05%
|
|
|
|
10192 - Vacation | 35657 |
36.27%
|
8649 |
88.97%
|
|
|
|
10405 - Longest Common Subsequence | 66013 |
37.22%
|
14908 |
88.72%
|
|
|
|
10635 - Prince and Princess | 17981 |
36.72%
|
3444 |
81.59%
|
|
|
|
10739 - String to Palindrome | 8955 |
63.17%
|
3095 |
95.22%
|
|
| << Start < Prev 1 Next > End >> | ||
| Display # | Results 1 - 10 of 10 | |