Leetcode/455 and 2610

.vscode/settings.json

@@ -1,6 +1,5 @@
 {
   "workbench.colorTheme": "GitHub Dark Colorblind (Beta)",
-  "workbench.activityBar.visible": true,
   "workbench.colorCustomizations": {
     "editor.lineHighlightBackground": "#1073cf2d",
     "editor.lineHighlightBorder": "#9fced11f",

README.md

@@ -195,6 +195,7 @@
 - [414: Third maximum number](problems/leetcode/414) - Easy - Array
 - [433: Minimum genetic mutation](problems/leetcode/433)
 - [448: Find all numbers disappeared in an array](problems/leetcode/448) - Easy - Array
+- [455: Assign cookies](problems/leetcode/455) - Easy - Array
 - [485: Max consecutive ones](problems/leetcode/485) - Array
 - [487: Max consecutive ones II](problems/leetcode/487) - Medium - Array
 - [515: Find largest value in each tree row](problems/leetcode/515) - Medium - Tree
@@ -226,5 +227,6 @@
 - [1832: Check if the sentence is pangram](problems/leetcode/1832)
 - [1926: Nearest exit from entrance in maze](problems/leetcode/1926)
 - [2095: Delete the middle node of a linked list](problems/leetcode/2095)
-- [2225: Find players with zero or one losses](problems/leetcode/2225) - Map
 - [2131: Longest palindrome by concatenating two letter words](problems/leetcode/2131)
+- [2225: Find players with zero or one losses](problems/leetcode/2225) - Map
+- [2610: Convert an array into a 2d array with conditions](problems/leetcode/2610) - Medium - Array

problems/leetcode/2610/solution.js

@@ -0,0 +1,25 @@
+/**
+ * 
+ * @param {number[]} nums 
+ * @return {number[][]}
+ */
+const findMatrix = (nums) => {
+  const freq = {};
+  const res = [];
+
+  nums.forEach((num) => {
+    if (freq[num] !== undefined) {
+      freq[num] = freq[num] + 1;
+    } else {
+      freq[num] = 0;
+    }
+
+    if (res[freq[num]]) {
+      res[freq[num]].push(num);
+    } else {
+      res[freq[num]] = [num];
+    }
+  });
+
+  return res;
+}

problems/leetcode/455/solution.js

@@ -0,0 +1,21 @@
+/**
+ * 
+ * @param {number[]} g 
+ * @param {number[]} s 
+ * @return {number}
+ */
+const findContentChildren = (g, s) => {
+  const factors = [...g].sort((a, b) => a - b);
+  const cookieSizes = [...s].sort((a, b) => a - b);
+  let child = 0;
+  let cookie = 0;
+
+  while (child < factors.length && cookie < cookieSizes.length) {
+    if (factors[child] <= cookieSizes[cookie]) {
+      child++;
+    }
+    cookie++;
+  }
+
+  return child;
+}