You are given n rooms labeled from $0$ to $n - 1$ as a list rooms, where rooms[i] contains the keys available inside room i. Each key is an integer representing the label of a room it can unlock.

You start in room $0$, and you can collect keys from any room you are able to enter. A room can be entered if you already have its key, except for room $0$ which is initially open.

Return true if it is possible to enter every room, otherwise return false.

Constraints:

• n == rooms.length

• $2 \leq$ n $\leq 1000$

• $0 \leq$ rooms[i].length $\leq 1000$

• $1 \leq \sum$(rooms[i].length) $\leq 3000$

• $0 \leq$ rooms[i][j] $<$ n

• All values in rooms[i] are unique

Now, 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.