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 | 11571 |
34.02%
|
2572 |
69.17%
|
|
|
|
760 - DNA Sequencing | 11954 |
26.74%
|
2233 |
79.09%
|
|
|
|
1223 - Editor | 2731 |
57.71%
|
924 |
89.61%
|
|
|
|
1254 - Top 10 | 1419 |
42.64%
|
278 |
85.97%
|
|
|
|
11107 - Life Forms | 11092 |
27.73%
|
1305 |
76.78%
|
|
|
|
11512 - GATTACA | 9652 |
45.85%
|
2486 |
85.64%
|
|
| << Start < Prev 1 Next > End >> | ||
| Display # | Results 1 - 6 of 6 | |