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

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

Given an integer array nums, handle multiple queries of the following type:

Calculate the sum of the elements of nums between indices left and right inclusive where left less than equal to right.
Implement the NumArray class:

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]).

Code with Alisha

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

Комментарии

very nice explaination with clean code...
// good luck

shreyasg

You didnt need to make it so complex -> it can be done in a simple and easy to understand manner
class NumArray {
public:

vector<int> prefixSum;
NumArray(vector<int>& nums) {

int sum = 0;
for (int i = 0; i < nums.size(); i++) {

sum += nums[i];
this->prefixSum[i] = sum;
}
}

int sumRange(int left, int right) {

return (left - 1) >= 0 ? prefixSum[right] - prefixSum[left - 1]
: prefixSum[right];
}
};

aspiring_Sr.dev_Om

Agar 1 based indexing kare to kya change karna

adityadhanrajsinghara

Wao yr .. girls with such clean efficient coding 🔥

AmandeepSingh-wvyc

mam : accumulate name se koii function nhi hai leetcode me bata rha hai

Rahul-jziq

Kuch bhi matlab easy problem ka complex solution 😢

mdsaad

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

Range Sum Query Immutable - Leetcode 303 - Python

Range Sum Query 2D - Immutable - Leetcode 304 - Python

LeetCode 303 Range Sum Query - Immutable | Prefix Sum | Beginner Friendly Explanation

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

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

Range Sum Query 2D | Leetcode #304

Leetcode 303- Dynamic Programming| Range Sum Query

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

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

Range Sum of BST - Leetcode 938 - Python

LeetCode 303. Range Sum Query Immutable

Leetcode - Range Sum Query 2D - Immutable (Python)

Leetcode - Range Sum Query - Immutable (Python)

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

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

Leetcode - Range Sum Query - Mutable (Python)

Range Sum Query | LeetCode 303 | Coding Interview Tutorial

304. Range Sum Query 2D - Immutable | LEETCODE MEDIUM | PREFIX SUM

Range Sum Query - Mutable | Leetcode 307 | Segment Tree Concepts & Qns | Video 8 | codestorywith...

303. Range Sum Query - Immutable (Leetcode Easy)

Leetcode | 303. Range Sum Query - Immutable | Approach : Prefix-Sum Array | Easy | Javascript

303. Range Sum Query - Immutable | Leetcode | Python

LeetCode. 303 Range Sum Query Immutable

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