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 | 11451 |
33.78%
|
2530 |
68.77%
|
|
|
|
760 - DNA Sequencing | 11843 |
26.72%
|
2221 |
79.02%
|
|
|
|
1223 - Editor | 2693 |
57.48%
|
913 |
89.59%
|
|
|
|
1254 - Top 10 | 1398 |
42.70%
|
271 |
85.98%
|
|
|
|
11107 - Life Forms | 10914 |
27.52%
|
1291 |
76.84%
|
|
|
|
11512 - GATTACA | 9579 |
45.70%
|
2475 |
85.62%
|
|
| << Start < Prev 1 Next > End >> | ||
| Display # | Results 1 - 6 of 6 | |