Graph Theory37 sections · 1633 units
Open in Course

Problem - Parallel Courses III

LeetCode 2050

You are given nn courses labeled from 11 to nn. You are also given an array relations where relations[j] = [prevCourse_j, nextCourse_j] means course prevCoursejprevCourse_j must be completed before course nextCoursejnextCourse_j. Each course ii takes time[i] months to complete.

You can start multiple courses at the same time as long as their prerequisites are met. Find the minimum number of months needed to complete all courses.

Example: n=3n = 3, relations=[[1,3],[2,3]]relations = [[1,3],[2,3]], time=[3,2,5]time = [3,2,5]. Courses 11 and 22 start in parallel. Course 33 starts after both finish (month 33). Total: 3+5=83 + 5 = 8 months.