Available question text
Support efficient point updates and range-sum queries on an integer array: update index to a new value and return the sum of nums[left..right]. With up to 3·10^4 operations and array size up to 3·10^4, the problem requires better than O(n) per operation (commonly solved with a segment tree or Fenwick tree for O(log n) updates/queries).
Related questions
Continue with questions that share topics or the same question type.
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 307. Range Sum Query - Mutable
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source