Available question text
Given a DAG of course prerequisites, determine for each query whether there is a directed path from course u to course v (i.e., whether u is an indirect or direct prerequisite of v). With numCourses ≤ 100 and up to 10^4 queries, the core challenge is efficiently precomputing reachability/transitive closure to answer many queries quickly.
Related questions
Continue with questions that share topics or the same question type.
- Course Schedule
Coding · Breadth-First Search · Depth-First Search · Directed Acyclic Graph
- Course Schedule II
Coding · Breadth-First Search · Depth-First Search · Graph Theory
- Course Schedule III
Coding
- Find the Longest Valid Obstacle Course at Each Position
Coding
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 1462. Course Schedule IV
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source