Multiple ChoiceHard 30s
Fenwick Tree (BIT)
A Fenwick Tree (Binary Indexed Tree) efficiently computes:
Options
- 1Prefix sums with O(log n) updates and queries
- 2Rolling string hashes over a sliding window
- 3Graph connectivity under edge insertion
- 4Suffix sums of an array in constant time
Think you can answer under pressure?
Get matched and answer live questions in 3-minute 1v1 battles. Elo ranking, badge tiers and bragging rights on the line.