Leetcode Problem 210. Course Schedule II

210. Course Schedule II

Leetcode Solutions

Create a stack S to store the topologically sorted courses.
Construct an adjacency list from the prerequisites list.
Perform a DFS for each course that has not been visited.
During DFS, for each course, visit all its unvisited prerequisites.
After visiting all prerequisites for a course, add the course to the stack.
After all courses are processed, pop the stack to get the courses in the correct order.
Return the stack as an array if all courses are visited; otherwise, return an empty array.

Programming Language

Purpose:

General Question

Debug My Code

image/screenshot of info(optional)

Full Screen