exhesham.com
Toolskit for the SWE Interview
Graphs Longest path in DAG (Directed Acyclic Graph): Both greedy and dynamic approach: 1. Find topological sort 2. Init distance from the source to each node to be minus infinite and zero for the s…