Check if courses can be completed

What this Python exercise asks you to practise

This scenario tests check if courses can be completed. It belongs to the Graphs and Connectivity roadmap and uses the topological sort · cycle detection · company screen pattern.

Graph representation, BFS, DFS, shortest paths, topological order, and union-find.

Pattern relevance

This exercise strengthens topological sort · cycle detection · company screen. Be ready to explain the input, the rule, the boundary cases, and why the chosen approach is appropriate.