Update README.md

Author: Jaskaran Singh

README.md

@@ -27,3 +27,4 @@
 | 1470 | Shuffle the Array | Given the array nums consisting of 2n elements in the form [x1,x2,...,xn,y1,y2,...,yn]. Return the array in the form [x1,y1,x2,y2,...,xn,yn]. | [Solution](shuffle_array.js) |
 | 1480 | Running Sum of 1d Array | Given an array nums. We define a running sum of an array as runningSum[i] = sum(nums[0]…nums[i]). Return the running sum of nums. | [Solution](sum_1d_array.js) |
 | 1486 | XOR Operation in an Array | Given an integer n and an integer start. Define an array nums where nums[i] = start + 2\*i (0-indexed) and n == nums.length. Return the bitwise XOR of all elements of nums. | [Solution](xor_array.js) |
+| 1672 | Richest Customer Wealth | You are given an m x n integer grid accounts where accounts[i][j] is the amount of money the ith customer has in the jth 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. | [Solution](richest_customer_wealth.js) | |