solves richest customer wealth

Author: anishLearnsToCode

README.md

@@ -412,7 +412,7 @@
 | 1656 | [Design an Ordered Stream](https://leetcode.com/problems/design-an-ordered-stream)                                                                        |                                                              [![Java](assets/java.png)](src/DesignAnOrderedStream.java)                                                              |                                                                                                                                   |
 | 1662 | [Check If Two String Arrays are Equivalent](https://leetcode.com/problems/check-if-two-string-arrays-are-equivalent)                                      |                                                       [![Java](assets/java.png)](src/CheckIfTwoStringArraysAreEquivalent.java)                                                       |                                                                                                                                   |
 | 1668 | [Maximum Repeating Substring](https://leetcode.com/problems/maximum-repeating-substring)                                                                  |                                                            [![Java](assets/java.png)](src/MaximumRepeatingSubString.java)                                                            |                                                                                                                                   |
-| 1672 | [Richest Customer Wealth](https://leetcode.com/problems/richest-customer-wealth)                                                                          |                                                                                                                                                                                      |                                                                                                                                   |
+| 1672 | [Richest Customer Wealth](https://leetcode.com/problems/richest-customer-wealth)                                                                          |                                                              [![Java](assets/java.png)](src/RichestCustomerWealth.java)                                                              |                                                                                                                                   |
 | 1678 | [Goal Parser Interpretation](https://leetcode.com/problems/goal-parser-interpretation)                                                                    |                                                                                                                                                                                      |                                                                                                                                   |
 | 1684 | [Count the Number of Consistent Strings](https://leetcode.com/problems/count-the-number-of-consistent-strings)                                            |                                                                                                                                                                                      |                                                                                                                                   |
 | 1688 | [Count of Matches in Tournament](https://leetcode.com/problems/count-of-matches-in-tournament)                                                            |                                                                                                                                                                                      |                                                                                                                                   |

src/RichestCustomerWealth.java

@@ -0,0 +1,11 @@
+import java.util.Arrays;
+
+public class RichestCustomerWealth {
+    public int maximumWealth(int[][] accounts) {
+        int maxWealth = 0;
+        for (int[] customer : accounts) {
+            maxWealth = Math.max(maxWealth, Arrays.stream(customer).sum());
+        }
+        return maxWealth;
+    }
+}