203rd Commit

README.md

@@ -201,12 +201,14 @@ Ace Coding Interview with 75 Qs
 [700]: ./src/page-7/700.%20Search%20in%20a%20Binary%20Search%20Tree/searchBST.ts
 [450]: ./src/page-5/450.%20Delete%20Node%20in%20a%20BST/deleteNode.ts
 
-| Graphs - DFS                                                 |          |        |
-| ------------------------------------------------------------ | -------- | ------ |
-| 841. Keys and Rooms                                          | Solution | Medium |
-| 547. Number of Provinces                                     | Solution | Medium |
-| 1466. Reorder Routes to Make All Paths Lead to the City Zero | Solution | Medium |
-| 399. Evaluate Division                                       | Solution | Medium |
+| Graphs - DFS                                                 |                 |        |
+| ------------------------------------------------------------ | --------------- | ------ |
+| 841. Keys and Rooms                                          | [Solution][841] | Medium |
+| 547. Number of Provinces                                     | Solution        | Medium |
+| 1466. Reorder Routes to Make All Paths Lead to the City Zero | Solution        | Medium |
+| 399. Evaluate Division                                       | Solution        | Medium |
+
+[841]: ./src/page-8/841.%20Keys%20and%20Rooms/canVisitAllRooms.ts
 
 | Graphs - BFS                             |          |        |
 | ---------------------------------------- | -------- | ------ |

src/page-8/841. Keys and Rooms/canVisitAllRooms.test.ts

@@ -0,0 +1,8 @@
+import { canVisitAllRooms } from './canVisitAllRooms';
+
+describe('841. Keys and Rooms', () => {
+  test('canVisitAllRooms', () => {
+    expect(canVisitAllRooms([[1], [2], [3], []])).toBe(true);
+    expect(canVisitAllRooms([[1, 3], [3, 0, 1], [2], [0]])).toBe(false);
+  });
+});

src/page-8/841. Keys and Rooms/canVisitAllRooms.ts

@@ -0,0 +1,22 @@
+type CanVisitAllRooms = (rooms: number[][]) => boolean;
+
+/**
+ * Accepted
+ */
+export const canVisitAllRooms: CanVisitAllRooms = (rooms) => {
+  const visited = new Set<number>();
+
+  function dfs(room: number) {
+    visited.add(room);
+
+    for (const key of rooms[room]) {
+      if (!visited.has(key)) {
+        dfs(key);
+      }
+    }
+  }
+
+  dfs(0);
+
+  return visited.size === rooms.length;
+};