Available question text
Given an initial zero array and a list of range update operations [start, end, inc], apply all increments and return the final array; the challenge is to handle many range updates efficiently (better than naive per-element updates) using a difference-array / prefix-sum pattern to achieve O(n + k) time.
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 370. Range Addition
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source