[SOLVED!] - Running Sum of 1d Array - LeetCode 1480 - Java

#coding #interviews #softwareengineering

The solution to LeetCode problem 1480.

Description: 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.

Solution: I start with software engineering interview question by explaining the problem, coding the solution, running it through IntelliJ, and finally submitting it in LeetCode. Join me as I try to explain the solution and like or subscribe if you found it helpful. Thanks!


SOCIAL
----------------------------------------------------------------------------------------------------------------