Add solution #2115

Author: JoshCrozier

README.md

@@ -852,6 +852,7 @@
 2095|[Delete the Middle Node of a Linked List](./2095-delete-the-middle-node-of-a-linked-list.js)|Medium|
 2099|[Find Subsequence of Length K With the Largest Sum](./2099-find-subsequence-of-length-k-with-the-largest-sum.js)|Medium|
 2114|[Maximum Number of Words Found in Sentences](./2114-maximum-number-of-words-found-in-sentences.js)|Easy|
+2115|[Find All Possible Recipes from Given Supplies](./2115-find-all-possible-recipes-from-given-supplies.js)|Medium|
 2116|[Check if a Parentheses String Can Be Valid](./2116-check-if-a-parentheses-string-can-be-valid.js)|Medium|
 2127|[Maximum Employees to Be Invited to a Meeting](./2127-maximum-employees-to-be-invited-to-a-meeting.js)|Hard|
 2129|[Capitalize the Title](./2129-capitalize-the-title.js)|Easy|

solutions/2115-find-all-possible-recipes-from-given-supplies.js

@@ -0,0 +1,63 @@
+/**
+ * 2115. Find All Possible Recipes from Given Supplies
+ * https://leetcode.com/problems/find-all-possible-recipes-from-given-supplies/
+ * Difficulty: Medium
+ *
+ * You have information about n different recipes. You are given a string array recipes and a 2D
+ * string array ingredients. The ith recipe has the name recipes[i], and you can create it if you
+ * have all the needed ingredients from ingredients[i]. A recipe can also be an ingredient for
+ * other recipes, i.e., ingredients[i] may contain a string that is in recipes.
+ *
+ * You are also given a string array supplies containing all the ingredients that you initially
+ * have, and you have an infinite supply of all of them.
+ *
+ * Return a list of all the recipes that you can create. You may return the answer in any order.
+ *
+ * Note that two recipes may contain each other in their ingredients.
+ */
+
+/**
+ * @param {string[]} recipes
+ * @param {string[][]} ingredients
+ * @param {string[]} supplies
+ * @return {string[]}
+ */
+var findAllRecipes = function(recipes, ingredients, supplies) {
+  const available = new Set(supplies);
+  const recipeGraph = new Map();
+  const inDegree = new Map();
+  const queue = [];
+  const result = [];
+
+  recipes.forEach((recipe, index) => {
+    inDegree.set(recipe, ingredients[index].length);
+    ingredients[index].forEach(ing => {
+      if (!recipeGraph.has(ing)) recipeGraph.set(ing, []);
+      recipeGraph.get(ing).push(recipe);
+    });
+  });
+
+  available.forEach(supply => {
+    if (recipeGraph.has(supply)) {
+      recipeGraph.get(supply).forEach(recipe => {
+        const count = inDegree.get(recipe) - 1;
+        inDegree.set(recipe, count);
+        if (count === 0) queue.push(recipe);
+      });
+    }
+  });
+
+  while (queue.length) {
+    const currentRecipe = queue.shift();
+    result.push(currentRecipe);
+    if (recipeGraph.has(currentRecipe)) {
+      recipeGraph.get(currentRecipe).forEach(nextRecipe => {
+        const count = inDegree.get(nextRecipe) - 1;
+        inDegree.set(nextRecipe, count);
+        if (count === 0) queue.push(nextRecipe);
+      });
+    }
+  }
+
+  return result;
+};