# SUBMIssions

[Richest Customer Wealth](https://leetcode.com/problems/richest-customer-wealth/)

class Solution {
    public int maximumWealth(int[][] accounts) {
        int max = Integer.MIN_VALUE;
        int currentRowSum;
        for(int i = 0; i < accounts.length; i++){
            currentRowSum = 0;
            for(int j = 0; j < accounts[0].length; j++){
                currentRowSum += accounts[i][j];
            }
            if(currentRowSum > max) max = currentRowSum;
        }
        return max;
    }
}

[Running Sum of 1d Array](https://leetcode.com/problems/running-sum-of-1d-array/)

class Solution {
    public int[] runningSum(int[] nums) {
        int idx = 1;
        while (idx < nums.length){
            nums[idx] += nums[idx-1];
            idx++;
        }
        return nums;
    }
}

Account: