Solution: Range Sum Query - Immutable

Explore how to implement the NumArray class to efficiently calculate the sum of elements between given indices using a prefix sum array. Understand how this approach reduces repeated calculations, enabling constant time queries after a linear-time setup. This lesson helps you design custom data structures for handling multiple range sum queries effectively in C#.

We'll cover the following...

Statement
Solution
- Time complexity
- Space complexity

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$ ...