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 | 11548 |
34.00%
|
2567 |
69.11%
|
|
|
|
760 - DNA Sequencing | 11930 |
26.72%
|
2232 |
79.08%
|
|
|
|
1223 - Editor | 2715 |
57.57%
|
921 |
89.58%
|
|
|
|
1254 - Top 10 | 1417 |
42.55%
|
277 |
85.92%
|
|
|
|
11107 - Life Forms | 11078 |
27.71%
|
1301 |
76.71%
|
|
|
|
11512 - GATTACA | 9642 |
45.82%
|
2485 |
85.63%
|
|
| << Start < Prev 1 Next > End >> | ||
| Display # | Results 1 - 6 of 6 | |