Problem: Range Sum Query - Immutable

Easy

15 min

Explore how to design and implement the NumArray class to efficiently handle range sum queries on an integer array. Understand how to initialize and query sums between indices without modifying the original array, improving problem-solving skills with custom data structures.

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$ nums.length $\leq 10^3$
$-10^5 \leq$ nums[i] $\leq 10^5$
$0 \leq$ i $\leq$ j $<$ nums.length
At most, $10^3$ calls will be made to sum_range.

Problem: Range Sum Query - Immutable

Easy

15 min

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$ nums.length $\leq 10^3$
$-10^5 \leq$ nums[i] $\leq 10^5$
$0 \leq$ i $\leq$ j $<$ nums.length
At most, $10^3$ calls will be made to sum_range.

Problem: Range Sum Query - Immutable

Statement

Examples

Understand the problem

Figure it out!

Try it yourself

Problem: Range Sum Query - Immutable

Statement

Examples

Understand the problem

Figure it out!

Try it yourself