Course Schedule | Deadlock detection | Graph coloring | Leetcode #207
This video explains a very important programming interview problem which is, given a course schedule with prerequisites for each course, find if it is possible to take all the courses satisfying the prerequisites for each course. If it is possible then return TRUE otherwise FALSE.This problem is same as detecting a deadlock in a single resource instance distributed system.In such a system, if we have a cycle then we a deadlock.Therefore, this problem further reduces to finding cycle in a graph.I have shown the solution using graph coloring to detect cycle in a directed graph.At the end of the video, i have explained the CODE. CODE LINK is present below as usual. If you find any difficulty or have any query then do COMMENT below. PLEASE help our channel by SUBSCRIBING and LIKE our video if you found it helpful...CYA :)
=================================================================
INSTAGRAM: https://www.instagram.com/surya.pratap.k/
LinkedIn: https://www.linkedin.com/in/surya-pratap-kahar-47bb01168
=================================================================
CODE LINK: https://gist.github.com/SuryaPratapK/bc2eb3010496a98bb3507eecc06e5887
SIMILAR PROBLEMS:-
Detect cycle in a directed graph: https://youtu.be/0dJmTuMrUZM
Detect cycle in an undirected graph: https://youtu.be/L0DcePeWHnM
Видео Course Schedule | Deadlock detection | Graph coloring | Leetcode #207 канала TECH DOSE
=================================================================
INSTAGRAM: https://www.instagram.com/surya.pratap.k/
LinkedIn: https://www.linkedin.com/in/surya-pratap-kahar-47bb01168
=================================================================
CODE LINK: https://gist.github.com/SuryaPratapK/bc2eb3010496a98bb3507eecc06e5887
SIMILAR PROBLEMS:-
Detect cycle in a directed graph: https://youtu.be/0dJmTuMrUZM
Detect cycle in an undirected graph: https://youtu.be/L0DcePeWHnM
Видео Course Schedule | Deadlock detection | Graph coloring | Leetcode #207 канала TECH DOSE
Показать
Комментарии отсутствуют
Информация о видео
Другие видео канала
Duplicate number in an immutable array | Floyd cycle detection algo | Leetcode #287Reconstruct Itinerary | Leetcode #332Detect cycle in an undirected graph | Graph coloring methodTopological Sort (with DFS) in 10 minutes + Course Schedule LeetCodeHow to crack dream job in just 2 monthsMinimum edit distance | Dynamic programming | BacktrackingPossible Bipartition | Bipartite graph | Graph coloring | Leetcode #886Random Pick with Weight | Bucket approach | Leetcode #528 | Binary searchCourse Schedule | LeetCode 207 | Cycle in Directed Graph | C++, Java, PythonUnique Paths | Dynamic programming | Leetcode #62Detect cycle in a directed graphRemove K digits | Build lowest number | Leetcode #402Perfect subarray | Google Kickstart 2020 | Round C | Q3Counting Bits | Leetcode #338Coin Change 2 | Dynamic programming | Leetcode #518Next greater element in an arrayH Index II | Binary search | Leetcode #275Topological Sort Graph | Leetcode 207 | Course ScheduleQueue Reconstruction by Height | Leetcode #406Perfect squares | Dynamic programming | Legendre's theorem | Leetcode #279