Solution: Course Schedule II

Statement▼

You are given n courses, labeled from 0 to n - 1. Some courses have prerequisites, which are provided as a list of pairs: prerequisites[i] $= [a, b]$ . To take course $a$ , you must first complete course $b$ .

Your task is to determine a valid order in which you can complete all the courses and return it as an array of course labels.

If there are multiple valid orderings, you can return any of them.
If it’s impossible to finish all courses (due to a cycle in prerequisites), return an empty array.

Note: There can be a course in the $0$ to $n−1$ range with no prerequisites.

Constraints:

Let $n$ be the number of courses.

$1 \leq n \leq 1500$
$0 \leq$ prerequisites.length $\leq 1000$
prerequisites[i].length $== 2$
$0 \leq a, \space b < n$
$a \neq b$
All the pairs $[a, \space b]$ are distinct.

Naive approach

The naive approach to solving the course scheduling problem involves handling prerequisite relationships using nested loops. For each course, we iterate through the list of prerequisites to identify which other courses must be ...

⋮

Tap here to switch tabs

Problem

Ask

Submissions

Solution

Home

Courses

Grokking the Coding Interview Patterns