Course Schedule Problem

Course Schedule Problem — ExecCode Medium DSA Practice

Solve the Course Schedule problem on ExecCode. Free online medium DSA practice in Graph. Write and run code in Java, C++, Python — no signup required to run.

Problem description

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.

Examples

Input numCourses = 6, prerequisites = [[1, 0], [2, 0], [3, 1], [3, 2], [4, 3], [5, 4]]; Output true. Input numCourses = 2, prerequisites = [[1, 0], [0, 1]]; Output false. Input numCourses = 1, prerequisites = []; Output true

Constraints

1 ≤ numCourses ≤ 2000 0 ≤ prerequisites.length ≤ 5000 prerequisites[i].length == 2 0 ≤ ai, bi < numCourses All pairs are unique.

Practice Course Schedule free on ExecCode. Browse DSA problems, topic map, and placement guides.