Update README.md

Author: TheCoderSingh

README.md

@@ -56,7 +56,7 @@
 | 1512 | Number of Good Pairs | Given an array of integers nums. A pair (i,j) is called good if nums[i] == nums[j] and i < j. Return the number of good pairs. | [Solution](number_good_pairs.js) |
 | 1528 | Shuffle String | Given a string s and an integer array indices of the same length. The string s will be shuffled such that the character at the ith position moves to indices[i] in the shuffled string. Return the shuffled string. | [Solution](shuffle_string.js) |
 | 1603 | Design Parking System | Design a parking system for a parking lot. The parking lot has three kinds of parking spaces: big, medium, and small, with a fixed number of slots for each size. | [Solution](parking_system.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) | |
+| 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) |
 | 1683 | Invalid Tweets | Write a solution to find the IDs of the invalid tweets. The tweet is invalid if the number of characters used in the content of the tweet is strictly greater than 15. | [Solution](invalid_tweets.sql)  |
 | 1757 | Recyclable and Low Fat Products | Write a solution to find the ids of products that are both low fat and recyclable. | [Solution](recyclable_low_fat.sql) |
 | 1920 | Build Array from Permutation | Given a zero-based permutation nums (0-indexed), build an array ans of the same length where ans[i] = nums[nums[i]] for each 0 <= i < nums.length and return it. | [Solution](array_from_permutation.js) |