Answer half-open range queries
Difficulty: Easy
For each [start,end] return sum(values[start:end]). Queries obey 0 <= start <= end <= n.
Examples
[2, -1, 4], [[0, 3], [1, 1], [1, 3]][5, 0, 3][], [[0, 0]][0][3], [][]Constraints
Use the stated representation and return value. Do not mutate inputs. Unless a tighter limit is stated, arrays contain at most 200 integers in -1000..1000; graphs have at most 100 vertices, valid indices and 1000 edges; tree depth is at most 30. No network or file access. Tests support learning; review the implementation to check the requested algorithm.
Review lesson: Arrays and prefix computationsA little nudge
Reveal one hint at a time. Give yourself a moment to try it.
Worked solution
Try your own approach first, then compare the reasoning.
Complexity
Ready when you are
Write your solution, then run it against the practice tests.
Press Esc, then Tab to leave the editor. Code runs in an isolated browser workspace. Tests support learning, not verified grading.