Category Archives: Leetcode
Find Pivot Index
In this problem, we will receive an array of numbers, and we must return the index where the elements sum of left side of this index, is the same as well as right side. Notice that the pivot value does not count for either side. But we will have to use it in the next…
Running Sum of 1d Array
In this problem, we will receive an array of numbers, and we must return an array where every number is the sum of it previously numbers. To approach this problem, we will use an auxiliar variable to store the sum of every passed number in the loop. We will loop over the given array, at…