diff --git a/May_Leetcode_Challenge/Day18/Minimum Number of Vertices to Reach All Nodes.py b/May_Leetcode_Challenge/Day18/Minimum Number of Vertices to Reach All Nodes.py
new file mode 100644
index 0000000..19f94a0
--- /dev/null
+++ b/May_Leetcode_Challenge/Day18/Minimum Number of Vertices to Reach All Nodes.py	
@@ -0,0 +1,16 @@
+
+class Solution:
+    def findSmallestSetOfVertices(self, n: int, edges: List[List[int]]) -> List[int]:
+
+        income = collections.defaultdict(list)
+
+        for src,dst in edges:
+            income[dst].append(src)
+
+        res = []
+        for i in range(n):
+            if not income[i]:
+                res.append(i)
+
+        return res
+