I’ve decided that I will start reviewing some of the algorithm problems I come across while practicing on LeetCode. Problem 1480: Running Sum of 1d Array Given an array nums. We define a running sum of an array as runningSum[i] = sum(nums[0]…nums[i]). Return the running sum of nums. Example Input: nums = [1,2,3,4]
Output: [1,3,6,10]
Explanation: Running sum is obtained…