top of page

Keys and Rooms

Updated: Mar 24, 2021

There are N rooms and you start in room 0. Each room has a distinct number in 0, 1, 2, ..., N-1, and each room may have some keys to access the next room. Formally, each room i has a list of keys rooms[i], and each key rooms[i][j] is an integer in [0, 1, ..., N-1] where N = rooms.length. A key rooms[i][j] = v opens the room with number v. Initially, all the rooms start locked (except for room 0).

You can walk back and forth between rooms freely.

Return true if and only if you can enter every room.

Example 1:

Input: [[1],[2],[3],[]] 
Output: true 
Explanation:   We start in room 0, and pick up key 1. We then go to room 1, and pick up key 2. We then go to room 2, and pick up key 3. We then go to room 3.  Since we were able to go to every room, we return true. 

Example 2:

Input: [[1,3],[3,0,1],[2],[0]] 
Output: false 
Explanation: We can't enter the room with number 2. 


  1. 1 <= rooms.length <= 1000

  2. 0 <= rooms[i].length <= 1000

  3. The number of keys in all rooms combined is at most 3000.


class Solution {
    public boolean canVisitAllRooms(List<List<Integer>> rooms) {
         Set<Integer> set = new HashSet();
        Queue<Integer> queue = new LinkedList();
        while(!queue.isEmpty()) {
            int index = queue.poll();
            for (int key : rooms.get(index)) {
                if (!set.contains(key)) {
        return set.size() == rooms.size();

11 views0 comments

Recent Posts

See All

Smallest String With A Given Numeric Value

The numeric value of a lowercase character is defined as its position (1-indexed) in the alphabet, so the numeric value of a is 1, the numeric value of b is 2, the numeric value of c is 3, and so on.


bottom of page