Update 841. Keys and Rooms.py

Co-Authored-By: Antim-IWP <203163676+Antim-IWP@users.noreply.github.com>
Co-Authored-By: Shiwangi Srivastava <174641070+IamShiwangi@users.noreply.github.com>

Author: 3 people

Solution/841. Keys and Rooms/841. Keys and Rooms.py

@@ -1 +1,12 @@
- 
+ class Solution:
+    def canVisitAllRooms(self, rooms: List[List[int]]) -> bool:
+        def dfs(i: int):
+            if i in vis:
+                return
+            vis.add(i)
+            for j in rooms[i]:
+                dfs(j)
+
+        vis = set()
+        dfs(0)
+        return len(vis) == len(rooms)