Fenwick Tree (BIT)

Category: Advanced

Difficulty: advanced

Description: Binary indexed tree for prefix sums

Time Complexity: O(log n)

Space Complexity: O(n)

Related LeetCode Problems

• 315. Count of Smaller Numbers After Self (Hard)
• 307. Range Sum Query - Mutable (Medium)
• 327. Count of Range Sum (Hard)