https://leetcode.com/problems/course-schedule/description/ a modification of this question where there is an array which consists of time required to complete each course and we need to find the minimum time to complete all the courses if courses can be done in parallel
Anonimo
I solved it using Topological sort