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 :: Suffix Trie, Tree, Array :: Standard
| Title | Total Submissions / Solving % | Total Users / Solving % | ||||
|
719 - Glass Beads | 11334 |
33.62%
|
2507 |
68.53%
|
|
|
|
760 - DNA Sequencing | 11677 |
26.79%
|
2208 |
79.12%
|
|
|
|
1223 - Editor | 2625 |
57.33%
|
905 |
89.50%
|
|
|
|
1254 - Top 10 | 1365 |
42.93%
|
267 |
86.52%
|
|
|
|
11107 - Life Forms | 10816 |
27.47%
|
1284 |
76.87%
|
|
|
|
11512 - GATTACA | 9549 |
45.64%
|
2467 |
85.57%
|
|
| << Start < Prev 1 Next > End >> | ||
| Display # | Results 1 - 6 of 6 | |