Richest Customer Wealth LeetCode Solution - The Coding Shala

Home >> LeetCode >> Richest Customer Wealth

 In this post, we will learn how to solve LeetCode's Richest Customer Wealth problem and will implement its solution in Java.

Richest Customer Wealth Problem

You are given an m x n integer grid accounts where accounts[i][j] is the amount of money 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
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

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

Practice this problem on LeetCode.

LeetCode - Richest Customer Wealth Java Solution

Approach 1

Brute Force solution.

Time Complexity: O(m * n)

Java Program: 

class Solution {
    public int maximumWealth(int[][] accounts) {
        int wealth = -1;
        for(int i = 0; i < accounts.length; i++) {
            int temp_sum = 0;
            for(int j = 0; j < accounts[i].length; j++) {
                temp_sum += accounts[i][j];
            if(temp_sum > wealth) {
                wealth = temp_sum;
        return wealth;

Other Posts You May Like
Please leave a comment below if you like this post or found some errors, it will help me to improve my content.


Popular Posts from this Blog

Basic Structure of C++ Program - The Coding Shala

Shell Script to find sum, product and average of given numbers - The Coding Shala

Shell Script to Create a Simple Calculator - The Coding Shala

First Unique Character in a String Java - The Coding Shala