From a8c40952d591bc9e590efa145695575e6aac8dd4 Mon Sep 17 00:00:00 2001
From: Kunal Chauhan <87843911+Kunal-Chauhan7@users.noreply.github.com>
Date: Sun, 9 Oct 2022 16:25:45 +0530
Subject: [PATCH] Added a solution of Richest Customer Wealth

This code written in java and solves this question :
https://leetcode.com/problems/richest-customer-wealth/
---
 RichestCustomerWealth.java | 22 ++++++++++++++++++++++
 1 file changed, 22 insertions(+)
 create mode 100644 RichestCustomerWealth.java

diff --git a/RichestCustomerWealth.java b/RichestCustomerWealth.java
new file mode 100644
index 0000000..aefeb35
--- /dev/null
+++ b/RichestCustomerWealth.java
@@ -0,0 +1,22 @@
+class Solution {
+    public int maximumWealth(int[][] accounts) {
+        int m = accounts.length;
+		int n = accounts[0].length;
+		int arr[] = new int[m];
+		int sum = 0;
+		for(int i = 0 ; i < m ; i++) {
+			for(int j = 0 ; j < n ; j++) {
+				sum+=accounts[i][j];
+			}
+			arr[i] = sum;
+			sum=0;
+		}
+		int max = arr[0];
+		for(int i = 0 ; i < m ; i++) {
+			if(arr[i]>max) {
+				max = arr[i];
+			}
+		}
+		return max;
+    }
+}