Leetcode Problem 2492. Minimum Score of a Path Between Two Cities

2492. Minimum Score of a Path Between Two Cities

Leetcode Solutions

Create an adjacency list adj to represent the graph.
Initialize a queue q and add node 1 to it.
Initialize a visit array to keep track of visited nodes.
Initialize answer with the maximum possible value.
While the queue is not empty: a. Pop the front node from the queue. b. Iterate over all its connected edges. c. Update answer with the minimum of the current answer and the edge weight. d. If the connected node is not visited, mark it as visited and add it to the queue.
Return answer as the result.

Programming Language

Purpose:

General Question

Debug My Code

image/screenshot of info(optional)

Full Screen