Code RoomCourse schedule
HardPrep Room Coding #1579

Course schedule

CodingAlgorithms & data structuresSenior–Staff~35 min

There are numCourses courses (0..numCourses-1) and prerequisite pairs [a, b] meaning b must come before a. Return whether all courses can be finished.

Implement
can_finish(num_courses: int, prerequisites: list[list[int]]) → bool
Examples
in[2,[[1,0]]]outtrue
What a strong answer looks like

State your approach and its time/space complexity out loud before you optimize. Handle the edge cases (empty input, duplicates, overflow), and say why you chose this over the brute force. Green tests are the floor, not the grade.

0:00 of about 35 min
InputExpectedGot
[2,[[1,0]]]truenot run yetsample