Search
⌘K

Leetcode 841. Keys and Rooms

Given rooms as an adjacency list where keys in room i are directed edges to other rooms, determine whether all nodes are reachable starting from room 0. In other words, check reachability in a directed graph (e.g., via DFS/BFS) to see if every room can be visited.


Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Comments

Your account is free and you can post anonymously if you choose.