Determine if all courses can be completed
Company: Amazon
Role: Machine Learning Engineer
Category: Coding & Algorithms
Difficulty: medium
Interview Round: Technical Screen
You are building a planner for a training program with `n` courses labeled `0` through `n - 1`. You are given a list of prerequisite pairs `prerequisites`, where each pair `[course, prerequisite]` means `prerequisite` must be completed before `course` can be taken.
Write a function that returns `true` if it is possible to complete all courses, and `false` otherwise.
Clarifications:
- A course may have multiple prerequisites.
- The prerequisite graph may contain disconnected components.
- If there is a dependency cycle, not all courses can be completed.
Example:
```text
n = 4
prerequisites = [[1, 0], [2, 1], [3, 2]]
Output: true
```
Example:
```text
n = 2
prerequisites = [[0, 1], [1, 0]]
Output: false
```
Quick Answer: This question evaluates graph-theoretic dependency modeling and cycle-detection competency, measuring the ability to represent course prerequisites as a directed graph within the Coding & Algorithms domain for a Machine Learning Engineer role.
