Add solution #1431

Author: JoshCrozier

README.md

@@ -179,6 +179,7 @@
 1402|[Reducing Dishes](./1402-reducing-dishes.js)|Hard|
 1408|[String Matching in an Array](./1408-string-matching-in-an-array.js)|Easy|
 1410|[HTML Entity Parser](./1410-html-entity-parser.js)|Medium|
+1431|[Kids With the Greatest Number of Candies](./1431-kids-with-the-greatest-number-of-candies.js)|Easy|
 1436|[Destination City](./1436-destination-city.js)|Easy|
 1437|[Check If All 1's Are at Least Length K Places Away](./1437-check-if-all-1s-are-at-least-length-k-places-away.js)|Easy|
 1446|[Consecutive Characters](./1446-consecutive-characters.js)|Easy|

solutions/1431-kids-with-the-greatest-number-of-candies.js

@@ -0,0 +1,25 @@
+/**
+ * 1431. Kids With the Greatest Number of Candies
+ * https://leetcode.com/problems/kids-with-the-greatest-number-of-candies/
+ * Difficulty: Easy
+ *
+ * There are n kids with candies. You are given an integer array candies, where each
+ * candies[i] represents the number of candies the ith kid has, and an integer
+ * extraCandies, denoting the number of extra candies that you have.
+ *
+ * Return a boolean array result of length n, where result[i] is true if, after giving
+ * the ith kid all the extraCandies, they will have the greatest number of candies
+ * among all the kids, or false otherwise.
+ *
+ * Note that multiple kids can have the greatest number of candies.
+ */
+
+/**
+ * @param {number[]} candies
+ * @param {number} extraCandies
+ * @return {boolean[]}
+ */
+var kidsWithCandies = function(candies, extraCandies) {
+  const max = Math.max(...candies);
+  return candies.map(count => count + extraCandies >= max);
+};