57. Segment Tree

Hard

Topics

Helpful tools to learn & understand

Watch key transitions, pointers, and variables update step-by-step.

Open

Read clean, documented implementations across multiple patterns.

View Code

Sketch diagrams on an infinite canvas and draft notes directly inline.

Draw

Input: nums = [1, 3, 5, 7, 9, 11], left = 1, right = 4

Output: 24

Explanation: The sum of nums[1] + nums[2] + nums[3] + nums[4] = 3 + 5 + 7 + 9 = 24

Input: nums = [1, 2, 3], left = 0, right = 2

Output: 6

Explanation: The sum of nums[0] + nums[1] + nums[2] = 1 + 2 + 3 = 6

Input: nums = [-2, 0, 3, -5, 2, -1], left = 0, right = 5

Output: -3

Explanation: The sum is -2 + 0 + 3 + (-5) + 2 + (-1) = -3

Time Complexity

O(log n)

Space Complexity

O(n)