Topological Sort - Course Schedule II (Topological Order)
You are given a list of courses and their prerequisite pairs. You need to find an order to take all courses such that all prerequisites are satisfied. Which algorithmic approach guarantees an optimal solution to determine such an order if it exists?
