This question has recently been asked in Oracle coding interview round.
Here we are given a number of courses and an array which given dependencies between courses. We need to check the dependencies and find is it is possible to complete all the courses or not.
leetcode: leetcode.com/p...
In the end I have explained a bit about an adjoining problem where we have to give the order in which we can complete these courses:
leetcode.com/p...
this question can be asked in big tech like amazon, google, facebook, microsoft in coding intrerview round as this is a typical topological sort algorithm question.
system design: • System Design | Distri...
DS for beginners: • Arrays Data Structures...
leetcode solutions: • Leetcode 84 | Largest ...
github: github.com/The...
facebook group : / 741317603336313
twitter: / granthtech
16 сен 2024
