Merge pull request #1 from TheCoderSingh/TheCoderSingh-patch-1

Add problem 1431

Author: Jaskaran Singh

README.md

@@ -15,5 +15,6 @@
 | 1313 | Decompress Run-Length Encoded List | We are given a list nums of integers representing a list compressed with run-length encoding. Consider each adjacent pair of elements [freq, val] = [nums[2*i], nums[2*i+1]] (with i >= 0).  For each such pair, there are freq elements with value val concatenated in a sublist. Concatenate all the sublists from left to right to generate the decompressed list. | [Solution](decompress_run_length_encoded_list.js) |
 | 1342 | Number of Steps to Reduce a Number to Zero | Given a non-negative integer num, return the number of steps to reduce it to zero. If the current number is even, you have to divide it by 2, otherwise, you have to subtract 1 from it. | [Solution](reduce_to_zero.js) |
 | 1365 | How Many Numbers Are Smaller Than the Current Number | Given the array nums, for each nums[i] find out how many numbers in the array are smaller than it. That is, for each nums[i] you have to count the number of valid j's such that j != i and nums[j] < nums[i]. | [Solution](numbers_smaller_than_current.js) |
+| 1431 | Kids With the Greatest Number of Candies| For each kid check if there is a way to distribute extraCandies among the kids such that he or she can have the greatest number of candies among them. Notice that multiple kids can have the greatest number of candies. | [Solution](greatest_number_of_candies.js) |
 | 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) |
+| 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) | |