Hi, ↵
Here is the Question↵
You are given an array A of length N and q queries where each query is one of the following types:↵
↵
1 i val: Update the value at ith index to val (arr[i] = val)↵
↵
2 L R: find the sum of all the subarray of arr[L....R]↵
↵
Determine the value of query 2↵
Ex:↵
N = 5↵
↵
q 2;↵
↵
arr = [2, 1, 4, 3, 1]↵
↵
query = [(1, 2, 2), (2, 1, 3)]↵
↵
Output = 26↵
↵
How to approach this question↵
↵
I have to find sum of every subarray of arr[L...R] ans will be arr[L] + arr[L...(L + 1)] + arr[L...(L +2)] +.....arr[L....R] + arr[L + 1] + (arr(L + 1)..(L + 2)] +.....(arr[(L + 1)...R])......↵
↵
constraint 1 <= N, q <= 100000↵
↵
Here is the Question↵
You are given an array A of length N and q queries where each query is one of the following types:↵
↵
1 i val: Update the value at ith index to val (arr[i] = val)↵
↵
2 L R: find the sum of all the subarray of arr[L....R]↵
↵
Determine the value of query 2↵
Ex:↵
N = 5↵
↵
q 2;↵
↵
arr = [2, 1, 4, 3, 1]↵
↵
query = [(1, 2, 2), (2, 1, 3)]↵
↵
Output = 26↵
↵
How to approach this question↵
↵
I have to find sum of every subarray of arr[L...R] ans will be arr[L] + arr[L...(L + 1)] + arr[L...(L +2)] +.....arr[L....R] + arr[L + 1] + (arr(L + 1)..(L + 2)] +.....(arr[(L + 1)...R])......↵
↵
constraint 1 <= N, q <= 100000↵
↵
