| 일 | 월 | 화 | 수 | 목 | 금 | 토 |
|---|---|---|---|---|---|---|
| 1 | 2 | 3 | 4 | 5 | ||
| 6 | 7 | 8 | 9 | 10 | 11 | 12 |
| 13 | 14 | 15 | 16 | 17 | 18 | 19 |
| 20 | 21 | 22 | 23 | 24 | 25 | 26 |
| 27 | 28 | 29 | 30 |
Tags
- concurrency
- DWG
- Substring with Concatenation of All Words
- 109. Convert Sorted List to Binary Search Tree
- Decorator
- Protocol
- 밴픽
- Class
- 715. Range Module
- Regular Expression
- shiba
- Python
- attribute
- t1
- 30. Substring with Concatenation of All Words
- LeetCode
- kaggle
- iterator
- 43. Multiply Strings
- 컴퓨터의 구조
- Generator
- 운영체제
- data science
- 프로그래머스
- Convert Sorted List to Binary Search Tree
- 시바견
- 315. Count of Smaller Numbers After Self
- Python Implementation
- 파이썬
- Python Code
Archives
- Today
- Total
목록2115 (1)
Scribbling
LeetCode: 2115. Find All Possible Recipes from Given Supplies
For a given recipe, we need to check whether all the necessary elements can be supplied. If an element belongs to supplies, it's a piece of cake. Now the question is to deal with elements that belong to recipes. We can think of recipes as a graph with cycles. Plus, if there's a cycle among certain recipes, they can never be cooked. class Solution: def findAllRecipes(self, recipes: List[str], ing..
Computer Science/Coding Test
2022. 5. 3. 09:43