Main Idea of Topological Sort: Starts from node with no dependencies, goes up to all its dependents and checks them, when those dependents indegree is 0, append them to the queue
Link to Question: https://leetcode.com/problems/alien-d...
Time: O(V+E)
Space: O(V+E)