# Richest Customer Wealth – Leetcode Solution

In this post, we are going to solve the 1672. Richest Customer Wealth problem of Leetcode. This problem 1672. Richest Customer Wealth is a Leetcode easy level problem. Let’s see the code, 1672. Richest Customer Wealth – Leetcode Solution.

## Problem

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`

Now, let’s see the code of 1672. Richest Customer Wealth – Leetcode Solution.

# Richest Customer Wealth – Leetcode Solution

### 1672. Richest Customer Wealth – Solution in Java

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

### 1672. Richest Customer Wealth – Solution in C++

```class Solution {
public:
int maximumWealth(vector<vector<int>>& accounts) {
int res = 0;
for(int i =0;i<accounts.size();i++){
int temp = 0;
for(int j = 0;j<accounts[i].size();j++){
temp+=accounts[i][j];
}
res = max(res,temp);
}
return res;
}
};```

### 1672. Richest Customer Wealth– Solution in Python

```class Solution:
def maximumWealth(self, accounts: List[List[int]]) -> int:
wealthy_person=0
for balance in accounts:
total=sum(balance)
wealthy_person=max(wealthy_person,total)
return wealthy_person```

Note: This problem 1672. Richest Customer Wealth is generated by Leetcode but the solution is provided by CodingBroz. This tutorial is only for Educational and Learning purpose.