Day 42 of LeetCode
Documenting LeetCode solving.
Q116
210. Course Schedule II
Medium. Graph
Topological sort.
class Solution:
def findOrder(self, numCourses: int, prerequisites: List[List[int]]) -> List[int]:
prereq = { c:[] for c in range(numCourses) }
...
evelynsjourney.hashnode.dev1 min read