Leetcode Problem 1129. Shortest Path with Alternating Colors

1129. Shortest Path with Alternating Colors

Leetcode Solutions

Initialize an adjacency list adj to represent the graph, where adj[node] contains pairs (neighbor, color).
Initialize an array answer with all elements set to -1, to store the shortest path lengths.
Initialize a 2D array visit to track whether a node has been visited with a particular color.
Initialize a queue to perform BFS, starting with node 0 with 0 steps and a placeholder color -1.
While the queue is not empty, dequeue an element (node, steps, prevColor) and iterate over all (neighbor, color) pairs in adj[node].
If neighbor has not been visited with color and color is not prevColor, enqueue (neighbor, steps + 1, color) and update answer[neighbor] if it's the first visit.
Return the answer array.

Programming Language

Purpose:

General Question

Debug My Code

image/screenshot of info(optional)

Full Screen