Add solution #455

Author: JoshCrozier

README.md

@@ -363,6 +363,7 @@
 452|[Minimum Number of Arrows to Burst Balloons](./0452-minimum-number-of-arrows-to-burst-balloons.js)|Medium|
 453|[Minimum Moves to Equal Array Elements](./0453-minimum-moves-to-equal-array-elements.js)|Medium|
 454|[4Sum II](./0454-4sum-ii.js)|Medium|
+455|[Assign Cookies](./0455-assign-cookies.js)|Easy|
 456|[132 Pattern](./0456-132-pattern.js)|Medium|
 459|[Repeated Substring Pattern](./0459-repeated-substring-pattern.js)|Easy|
 461|[Hamming Distance](./0461-hamming-distance.js)|Easy|

solutions/0455-assign-cookies.js

@@ -0,0 +1,32 @@
+/**
+ * 455. Assign Cookies
+ * https://leetcode.com/problems/assign-cookies/
+ * Difficulty: Easy
+ *
+ * Assume you are an awesome parent and want to give your children some cookies. But, you
+ * should give each child at most one cookie.
+ *
+ * Each child i has a greed factor g[i], which is the minimum size of a cookie that the
+ * child will be content with; and each cookie j has a size s[j]. If s[j] >= g[i], we can
+ * assign the cookie j to the child i, and the child i will be content. Your goal is to
+ * maximize the number of your content children and output the maximum number.
+ */
+
+/**
+ * @param {number[]} g
+ * @param {number[]} s
+ * @return {number}
+ */
+var findContentChildren = function(g, s) {
+  g.sort((a, b) => a - b);
+  s.sort((a, b) => a - b);
+
+  let result = 0;
+  for (let j = 0; result < g.length && j < s.length; j++) {
+    if (s[j] >= g[result]) {
+      result++;
+    }
+  }
+
+  return result;
+};