Your Dashboard
Interview Coaching
Learn
System Design
ML System Design
Code
Behavioral
Salary Negotiation
Interview Guides
Search
⌘K
Get Premium
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.
All Regions
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.