Point Update, Range Sum (Fenwick Tree)
Medium
Segment Tree & Fenwick Tree
Support two operations on an array: update i v (add v to nums[i]) and sum l r (sum of nums[l..r]). Print the result of every sum operation.
Constraints
1 <= n, q <= 10^5 |values| <= 10^9
Discussion
No discussions yet.
Shalyam Support
Hi! Ask us anything — we'll reply on WhatsApp or Telegram within 24 hours.