Back to Questions

Course Schedule (Adjacency List & BFS)

32.2K views•Asked at Cisco•
Medium

Question Explain

Determine if you can finish all courses given an array of prerequisite pairs. Represent the problem as a graph (Adjacency List) and use Topological Sort via BFS (Kahn's algorithm).

Start Trying This Question Simulation

Practice answering orally or with text to get instant AI feedback.

Practice with This Question

Other interview questions like this

Reverse a Linked List

46K views

Kth Smallest Element in a BST

94.8K views

Lowest Common Ancestor of a BST

74.7K views
Course Schedule (Adjacency List & BFS) - Interview Question