| # | User | Rating |
|---|---|---|
| 1 | tourist | 3947 |
| 2 | ecnerwala | 3654 |
| 3 | jiangly | 3627 |
| 4 | jqdai0815 | 3620 |
| 5 | orzdevinwang | 3612 |
| 6 | Benq | 3586 |
| 7 | Radewoosh | 3582 |
| 8 | Geothermal | 3569 |
| 8 | cnnfls_csy | 3569 |
| 10 | ksun48 | 3474 |
| # | User | Contrib. |
|---|---|---|
| 1 | awoo | 163 |
| 2 | maomao90 | 160 |
| 3 | adamant | 156 |
| 4 | atcoder_official | 153 |
| 5 | maroonrk | 152 |
| 6 | -is-this-fft- | 148 |
| 6 | SecondThread | 148 |
| 8 | Petr | 147 |
| 9 | nor | 145 |
| 10 | cry | 144 |
suggest some easy — medium problems on Trie data structure (prefix tree) on codeforces
I've recently learned about the Trie data structure and am looking to practice some problems related to it. Could you suggest some easy to medium difficulty problems on the Trie data structure (prefix tree) available on Codeforces? I've tried searching but haven't found any suitable ones.
Note: This is my alternate account.
