Google interview question

a challenging coding question where they asked me to implement Dijkstra's shortest path algorithm for finding the minimum distance from a source node to all other nodes in a weighted graph, while also explaining how to use a priority queue for optimization and analyzing its time complexity.