Tutorial for how to use Dijkstra’s shortest path algorithm to solve coding interview questions.
We will solve “Network Delay Time” [LeetCode 743] and “Path with Maximum Probability” [LeetCode 1514]
Both are important graph coding questions commonly asked in programming interviews.
I recommend watching the Dijkstra video before this one. Link here -
Dijkstra's algorithm & code explanation: • Dijkstra’s Algorithm for Coding Inter...
Timestamps -
0:00 - Intro
0:23 - Network Delay Time
4:49 - Path with Maximum Probability