LeetCode 303. Range Sum Query - Immutable [Algorithm + Code Explained ]

Показать описание

One of the most frequently asked coding interview questions on Dynamic Programming in companies like Google, Facebook, Amazon, LinkedIn, Microsoft, Uber, Apple, Adobe etc.

LeetCode : Range Sum Query - Immutable

Question : Given an integer array nums, find the sum of the elements between indices i and j (i ≤ j), inclusive.

Example:
Given nums = [-2, 0, 3, -5, 2, -1]

sumRange(0, 2) - 1
sumRange(2, 5) - -1
sumRange(0, 5) - -3
Note:
You may assume that the array does not change.
There are many calls to sumRange function.

Рекомендации по теме

Комментарии

you have good understanding in this concept that will help others as well

rakeshreddyabbireddy

*Python*

class NumArray:
def __init__(self, nums: List[int]):
n = len(nums)
self.dp = [0] * (n + 1)
for i in range(1, n+1):
self.dp[i] = self.dp[i-1] + nums[i - 1]

def sumRange(self, left: int, right: int) -> int:
return self.dp[right + 1] - self.dp[left]

robogirlTinker

Thank you very much Tiwari. Amazing explanation.

mohammadyahya

Hey Jayati, thanks for the clear and precise explanation. Data points at 2:10 are really helpful i was wondering if you have it for all data structures? Please share it if you can .

codebhakt

excellent video !

Where can i get a cheat sheet for the patterns?

davidsierra

Can someone post solution in cpp with the same logic

kartiksharma

Basically dp[ ] is nothing but a prefix sum.

Dinesh_kuku

LeetCode 303. Range Sum Query - Immutable [Algorithm + Code Explained ]

Range Sum Query Immutable - Leetcode 303 - Python

Leetcode - Range Sum Query - Immutable (Python)

303. Range Sum Query - Immutable (Leetcode Easy)

Leetcode - 303 Range Sum Query - Immutable (Easy) in Java,Python

Range Sum Query - Immutable | Leetcode 303 | Live coding session 🔥🔥🔥 | Prefix Sum

LeetCode 303. Range Sum Query - Immutable [Algorithm + Code Explained ]

303. Range Sum Query - Immutable | Leetcode | Python

Range Sum Query - Immutable - LeetCode 303 - Coding Interview Questions

303. Range Sum Query - Immutable (Leetcode, Java)

Leetcode 303 - Range Sum Query - Immutable | Prefix Sum

Leetcode #303: Range Sum Query - Immutable || Easy || Leetcode || C++

Leetcode Range Sum Query - Immutable || Intuition + Example + Code

LeetCode #303 Range Sum Query - Immutable - Solution in C++

Leetcode 303 Range Sum Query - Immutable (Java)

Range Sum Query Immutable 303 Leetcode

Собеседование в IT | LeetCode | 303. Range Sum Query - Immutable

Leetcode 303 - Range Sum Query - Immutable | Explanation | Solution

LeetCode. 303 Range Sum Query Immutable

Leetcode 303 - Range Sum Query - Immutable

Leetcode 303- Dynamic Programming| Range Sum Query

303 Range Sum Query Immutable |array | leetcode 303 |Range Sum Query Immutable| placement

LeetCode - 303. Range Sum Query - Immutable | Segment Tree | Java

303. Range Sum Query - Immutable | Leetcode 303

Leetcode 303 - Range Sum Query - Immutable