GeeksForGeeks: 1-D prefix sum
Problem:
https://www.geeksforgeeks.org/problems/1-d-prefix-sum/1
Code:
class Solution:
def prefSum(self, arr):
for i in range(1,len(arr)):
arr[i] = arr[i-1] + arr[i]
return arr
Key Points:
A prefix sum array stores r...
is-power-of-two.hashnode.dev1 min read