UMN String problems
Problems
| Name | Solved / Tries | Average tries | Average tries to solve | |
|---|---|---|---|---|
| A | Bitwise | 0/0 (0%) | -- | -- |
| B | Fenwick Tree | 2/10 (20%) | 3.33 | 3.00 |
| C | Suffix Sorting | 0/4 (0%) | 4.00 | -- |
| D | Taboo | 0/0 (0%) | -- | -- |
| E | Wi Know | 0/0 (0%) | -- | -- |
| Name | Solved / Tries | Average tries | Average tries to solve | |
|---|---|---|---|---|
| A | Bitwise | 0/0 (0%) | -- | -- |
| B | Fenwick Tree | 2/10 (20%) | 3.33 | 3.00 |
| C | Suffix Sorting | 0/4 (0%) | 4.00 | -- |
| D | Taboo | 0/0 (0%) | -- | -- |
| E | Wi Know | 0/0 (0%) | -- | -- |