All challenges
Algorithm challenge · DSA
Course Schedule
Difficulty
hard
Time
~35m
Format
Single
Grading
Auto-graded
#python#javascript#typescript#go#java#cpp#rust#dsa#graphs#topological-sort
Mission file // read carefullyhard
There are numCourses courses labeled 0..numCourses-1. prerequisites[i] = [a, b] means you must take course b before course a. Return true if you can finish all courses (i.e. the dependency graph has no cycle).
Example
numCourses = 2, prerequisites = [[1,0]] => true
numCourses = 2, prerequisites = [[1,0],[0,1]] => false
Build with
canFinish(numCourses: int, prerequisites: int[][]) → boolPythonJavaScriptTypeScriptGoJavaC++Rust
4 tests · 1 hidden
Auto-graded on submit
Start challenge
Sign in to save your progress.