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 | 11387 |
33.63%
|
2515 |
68.63%
|
|
|
|
760 - DNA Sequencing | 11724 |
26.75%
|
2213 |
79.03%
|
|
|
|
1223 - Editor | 2637 |
57.26%
|
906 |
89.51%
|
|
|
|
1254 - Top 10 | 1365 |
42.93%
|
267 |
86.52%
|
|
|
|
11107 - Life Forms | 10879 |
27.51%
|
1286 |
76.91%
|
|
|
|
11512 - GATTACA | 9552 |
45.64%
|
2468 |
85.58%
|
|
| << Start < Prev 1 Next > End >> | ||
| Display # | Results 1 - 6 of 6 | |