You are given an undirected connected graph with n nodes numbered from $0$ to $n-1$. The graph is provided as an adjacency list, graph, where graph[i] contains all nodes that share an edge with node i.

Your task is to find the length of the shortest path that visits every node. You may:

• Start from any node.

• End at any node.

• Revisit nodes and reuse edges as many times as needed.

Constraints:

• n $==$ graph.length

• $1 \leq$ n $\leq 12$

• $0 \leq$ graph[i].length $<$ n

• graph[i] does not contain i.

• If graph[a] contains b, then graph[b] contains a.

• The input graph is always connected.

Let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.