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

Question

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

Utilisateur anonyme · Accepted Answer

I solved it using Topological sort

Pocket FM

Question d’entretien chez Pocket FM

Réponse à la question d'entretien

Entreprises suivies

Recherche d’emplois