TOPOLOGICAL SORT
+========+
Time: 30 minutes - 1 hour
Difficulty: Medium
Languages: Any
+========+
Given a directed acyclic graph represented by an adjacency list, implement a function that performs a topological sort of the graph and returns a list of the visited nodes
+========+
Please answer to this message with your solution 🙂
>>Click here to continue<<