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 | 11417 |
33.74%
|
2523 |
68.69%
|
|
|
|
760 - DNA Sequencing | 11793 |
26.76%
|
2217 |
79.03%
|
|
|
|
1223 - Editor | 2684 |
57.34%
|
909 |
89.55%
|
|
|
|
1254 - Top 10 | 1393 |
42.86%
|
270 |
86.30%
|
|
|
|
11107 - Life Forms | 10913 |
27.52%
|
1290 |
76.82%
|
|
|
|
11512 - GATTACA | 9571 |
45.68%
|
2471 |
85.59%
|
|
| << Start < Prev 1 Next > End >> | ||
| Display # | Results 1 - 6 of 6 | |