Fenwick Tree
Problems on Fenwick trees, including prefix sums with point updates, counting inversions, counting smaller elements to the left, range updates with point queries, and two-dimensional sums.
The prefix sums article in the Basics section covers the static version of the problem. Related problem sets are under Segment tree, Prefix sums and Range queries.
Problems
Segment Sum#2156
Very hard
Changing on a Segment (High)#2875
Very easy
Dima and large array#2940
Very easy
Dima and array#2941
Very easy
Inner Vertices#3061
Very easy
A Safe Bet#3395
Very easy
Bitris#3842
Very easy
Juggler#3976
Hard
Staircase Patterns#4073
Very easy
Sum on a segment#4255
Very easy
K-inversions#4952
Very easy
Fenechka#5274
Hard
Kitten's Task#5449
Very easy
Stars#5619
Medium
Mega Inversions#6021
Very easy
Building a Fenwick Tree#8247
Very easy
Daily Division#9870
Very hard
Mowing Mischief#10352
Very hard