2115. Find All Possible Recipes from Given Supplies

Description

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.

 

Example 1:

Input: recipes = ["bread"], ingredients = [["yeast","flour"]], supplies = ["yeast","flour","corn"]
Output: ["bread"]
Explanation:
We can create "bread" since we have the ingredients "yeast" and "flour".

Example 2:

Input: recipes = ["bread","sandwich"], ingredients = [["yeast","flour"],["bread","meat"]], supplies = ["yeast","flour","meat"]
Output: ["bread","sandwich"]
Explanation:
We can create "bread" since we have the ingredients "yeast" and "flour".
We can create "sandwich" since we have the ingredient "meat" and can create the ingredient "bread".

Example 3:

Input: recipes = ["bread","sandwich","burger"], ingredients = [["yeast","flour"],["bread","meat"],["sandwich","meat","bread"]], supplies = ["yeast","flour","meat"]
Output: ["bread","sandwich","burger"]
Explanation:
We can create "bread" since we have the ingredients "yeast" and "flour".
We can create "sandwich" since we have the ingredient "meat" and can create the ingredient "bread".
We can create "burger" since we have the ingredient "meat" and can create the ingredients "bread" and "sandwich".

 

Constraints:

• n == recipes.length == ingredients.length
• 1 <= n <= 100
• 1 <= ingredients[i].length, supplies.length <= 100
• 1 <= recipes[i].length, ingredients[i][j].length, supplies[k].length <= 10
• recipes[i], ingredients[i][j], and supplies[k] consist only of lowercase English letters.
• All the values of recipes and supplies combined are unique.
• Each ingredients[i] does not contain any duplicate values.

 

Solutions

Solution: Topological Sort

• Time complexity: O(n*ingredients[i].length)
• Space complexity: O(n)

 

JavaScript

/**
 * @param {string[]} recipes
 * @param {string[][]} ingredients
 * @param {string[]} supplies
 * @return {string[]}
 */
const findAllRecipes = function (recipes, ingredients, supplies) {
  const n = recipes.length;
  const suppliesSet = new Set(supplies);
  const indegreeMap = new Map();
  const graph = new Map();
  const result = [];
  let queue = [];

  for (let index = 0; index < n; index++) {
    const recipe = recipes[index];

    for (const ingredient of ingredients[index]) {
      if (suppliesSet.has(ingredient)) continue;
      if (!graph.has(ingredient)) graph.set(ingredient, []);
      const indegree = indegreeMap.get(recipe) ?? 0;

      graph.get(ingredient).push(recipe);
      indegreeMap.set(recipe, indegree + 1);
    }
  }

  for (const recipe of recipes) {
    if (indegreeMap.has(recipe)) continue;

    queue.push(recipe);
  }

  while (queue.length) {
    const nextQueue = [];

    for (const recipe of queue) {
      result.push(recipe);

      if (!graph.has(recipe)) continue;

      for (const nextRecipe of graph.get(recipe)) {
        const indegree = indegreeMap.get(nextRecipe);

        if (indegree - 1 === 0) {
          nextQueue.push(nextRecipe);
        }

        indegreeMap.set(nextRecipe, indegree - 1);
      }
    }

    queue = nextQueue;
  }

  return result;
};