Solution 1 - Row Sums

Sum each customer row; return the maximum sum.

TimeComplexity: O(mn)

SpaceComplexity: O(1)

""" 1672.1 - Richest Customer Wealth - Solution 1 - Row Sums """

from typing import List

class Solution:
    def maximumWealth(self, accounts: List[List[int]]) -> int:
        return max(sum(row) for row in accounts)

package main

func maximumWealth(accounts [][]int) int {
	best := 0
	for _, row := range accounts {
		s := 0
		for _, x := range row { s += x }
		if s > best { best = s }
	}
	return best
}

func main() {}

1672 - Richest Customer Wealth

Solution 1 - Row Sums