You are given a list of node connections, where each connection is a pair of node IDs, representing a grid of nodes. The goal is to find the shortest path to the central node in the grid.
Analyze constraints and compute optimal solutions step-by-step.
No dry run loaded.
🚀 Practice this problem
Run code, get AI hints & track streak