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.
Rating changes for last rounds are temporarily rolled back. They will be returned soon.
→ Pay attention
→ Streams
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | tourist | 3985 |
| 2 | jiangly | 3884 |
| 3 | jqdai0815 | 3682 |
| 4 | Benq | 3579 |
| 5 | orzdevinwang | 3526 |
| 6 | ksun48 | 3505 |
| 6 | ecnerwala | 3505 |
| 8 | Radewoosh | 3456 |
| 9 | Kevin114514 | 3377 |
| 10 | gamegame | 3374 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 169 |
| 2 | -is-this-fft- | 162 |
| 3 | Um_nik | 161 |
| 4 | atcoder_official | 160 |
| 5 | djm03178 | 157 |
| 5 | Dominater069 | 157 |
| 7 | adamant | 154 |
| 8 | luogu_official | 152 |
| 9 | awoo | 151 |
| 10 | TheScrasse | 148 |
→ Find user
→ Recent actions
Codeforces (c) Copyright 2010-2025 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Jan/11/2025 01:58:04 (i1).
Desktop version, switch to mobile version.
Supported by
