Range Sum Query - Immutable

Explore how to implement the NumArray class to handle multiple sumRange queries efficiently on an immutable integer array. Understand the problem constraints and practice developing solutions that compute sums between indices quickly using custom data structures.

We'll cover the following...

Statement
Examples
Understand the problem
Figure it out!
Try it yourself

Statement

You are given an integer array, nums, and you need to handle multiple queries of the following type:

Query: Calculate the sum of elements in nums between indices i and j (inclusive), where i <= j.

Implement the NumArray class to support the following operations efficiently:

Constructor: Initializes the object with the integer array nums.
sumRange(i, j): Returns the sum of the elements of nums between indices i and j (inclusive), i.e., the sum of nums[i] + nums[i + 1] + ... + nums[j].

Constraints:

$1 \leq$ ...