In the depths of a cyberpunk hacker network, a rogue AI has created a neon grid of 27 nodes, each containing a unique encryption key. To infiltrate the grid, a hacker must navigate through the nodes, collecting keys to unlock subsequent nodes. The hacker can move in any direction, but each node can only be visited once. The goal is to find the longest possible path through the grid, collecting the most valuable keys. The grid is represented as a list of node connections, where each connection is a pair of node IDs.
Analyze constraints and compute optimal solutions step-by-step.
No dry run loaded.
🚀 Practice this problem
Run code, get AI hints & track streak