You are coding as a Guest. Sign in with your RoleNest account to permanently track your streak, earn XP, and climb the Campus Leaderboard!
Sign In with RoleNestProblem Set
🔥Course Schedule: Topological Cycle DetectorMedium
DAILY PROBLEM OF THE DAY+50 XP • Daily Streak
Solve today's challenge or tackle one of the 3 Super Hard challenges for +150 XP.
MediumTrees & Graphs•Acceptance: 47.2%
Course Schedule: Topological Cycle Detector
Targeted in FAANG & Tech OA:GoogleAmazonUber
Real-World Engineering Context
Fundamental to package dependency resolvers (npm, cargo, pip), Terraform execution DAGs, and build systems like Bazel.
There are a total of `numCourses` courses you have to take, labeled from `0` to `numCourses - 1`. You are given an array `prerequisites` where `prerequisites[i] = [ai, bi]` indicates that you must take course `bi` first if you want to take course `ai`.
Return `true` if you can finish all courses. Otherwise, return `false`.
Sample Test Cases
Input: [2,[[1,0]]]
Expected: true
Input: [2,[[1,0],[0,1]]]
Expected: false
Input: [3,[[0,1],[0,2],[1,2]]]
Expected: true
Constraints
- 1 <= numCourses <= 2000
- 0 <= prerequisites.length <= 5000
- prerequisites[i].length == 2
- 0 <= ai, bi < numCourses
- All the pairs prerequisites[i] are unique.
Recruiter Fast-Track ReferralVerified Candidate
Direct pipeline to Google, Amazon, Microsoft, Swiggy, & Uber recruiters
Top DevScore profiles bypass resume screening filters. Every verified problem solve writes authentic proof-of-work to your profile and dispatches you directly into employer inboxes on RoleNest.
Explore 5,000+ Direct ATS Openings on RoleNest ↗✓ Direct Referral Active
Language:
Ready to test. Click Run Code or Submit Solution to run test cases in isolated browser sandbox.