# Range Sum Query — Immutable

1. Calculate the sum of the elements of `nums` between indices `left` and `right` inclusive where `left <= right`.
• `NumArray(int[] nums)` Initializes the object with the integer array `nums`.
• `int sumRange(int left, int right)` Returns the sum of the elements of `nums` between indices `left` and `right` inclusive (i.e. `nums[left] + nums[left + 1] + ... + nums[right]`).
`Input["NumArray", "sumRange", "sumRange", "sumRange"][[[-2, 0, 3, -5, 2, -1]], [0, 2], [2, 5], [0, 5]]Output[null, 1, -1, -3]ExplanationNumArray numArray = new NumArray([-2, 0, 3, -5, 2, -1]);numArray.sumRange(0, 2); // return (-2) + 0 + 3 = 1numArray.sumRange(2, 5); // return 3 + (-5) + 2 + (-1) = -1numArray.sumRange(0, 5); // return (-2) + 0 + 3 + (-5) + 2 + (-1) = -3`
• `1 <= nums.length <= 104`
• `-105 <= nums[i] <= 105`
• `0 <= left <= right < nums.length`
• At most `104` calls will be made to `sumRange`
`def __init__(self, nums: List[int]):        self.nums=nums        self.dp=[]        self.dp.append(0)        for i in range(len(self.nums)):            self.dp.append(self.dp[-1]+nums[i])def sumRange(self, left: int, right: int) -> int:        return(self.dp[right+1]-self.dp[left])`

--

-- ## Dhanarajappu

Tech-Enthusiast, Coder,Explorer,Geeky,Software Engineer |A piece of code delivers everything that you need. The world is all about codes.