1672. Richest Customer Wealth LeetCode Solution

In this guide, you will get 1672. Richest Customer Wealth LeetCode Solution with the best time and space complexity. The solution to Richest Customer Wealth problem is provided in various programming languages like C++, Java, and Python. This will be helpful for you if you are preparing for placements, hackathons, interviews, or practice purposes. The solutions provided here are very easy to follow and include detailed explanations.

Table of Contents

1. Problem Statement
2. Complexity Analysis
3. Richest Customer Wealth solution in C++
4. Richest Customer Wealth solution in Java
5. Richest Customer Wealth solution in Python
6. Additional Resources

Problem Statement of Richest Customer Wealth

You are given an m x n integer grid accounts where accounts[i][j] is the amount of money the i​​​​​​​​​​​th​​​​ customer has in the j​​​​​​​​​​​th​​​​ bank. Return the wealth that the richest customer has.
A customer’s wealth is the amount of money they have in all their bank accounts. The richest customer is the customer that has the maximum wealth.

Example 1:

Input: accounts = [[1,2,3],[3,2,1]]
Output: 6
Explanation:
1st customer has wealth = 1 + 2 + 3 = 6
2nd customer has wealth = 3 + 2 + 1 = 6
Both customers are considered the richest with a wealth of 6 each, so return 6.

Example 2:

Input: accounts = [[1,5],[7,3],[3,5]]
Output: 10
Explanation:
1st customer has wealth = 6
2nd customer has wealth = 10
3rd customer has wealth = 8
The 2nd customer is the richest with a wealth of 10.
Example 3:

Input: accounts = [[2,8,7],[7,1,3],[1,9,5]]
Output: 17

Constraints:

m == accounts.length
n == accounts[i].length
1 <= m, n <= 50
1 <= accounts[i][j] <= 100

Complexity Analysis

• Time Complexity: O(mn)
• Space Complexity: O(1)

1672. Richest Customer Wealth LeetCode Solution in C++

class Solution {
 public:
  int maximumWealth(vector<vector<int>>& accounts) {
    return accumulate(accounts.begin(), accounts.end(), 0,
                      [](int subtotal, const vector<int>& account) {
      return max(subtotal, accumulate(account.begin(), account.end(), 0));
    });
  }
};
/* code provided by PROGIEZ */

1672. Richest Customer Wealth LeetCode Solution in Java

class Solution {
  public int maximumWealth(int[][] accounts) {
    return Arrays.stream(accounts)
        .mapToInt(account -> Arrays.stream(account).sum())
        .max()
        .getAsInt();
  }
}
// code provided by PROGIEZ

1672. Richest Customer Wealth LeetCode Solution in Python

class Solution:
  def maximumWealth(self, accounts: list[list[int]]) -> int:
    return max(map(sum, accounts))
 # code by PROGIEZ

Additional Resources

• Explore all LeetCode problem solutions at Progiez here
• Explore all problems on LeetCode website here

Happy Coding! Keep following PROGIEZ for more updates and solutions.