Time: 288 ms (67.33%), Space: 106.6 MB (42.32%) - LeetHub

Author: JanaSabuj

minimum-number-of-vertices-to-reach-all-nodes/minimum-number-of-vertices-to-reach-all-nodes.cpp

@@ -0,0 +1,17 @@
+class Solution {
+public:
+    vector<int> findSmallestSetOfVertices(int n, vector<vector<int>>& edges) {
+        vector<int> indeg(n, 0);
+        for(auto v: edges){
+            indeg[v[1]]++;
+        }
+        
+        vector<int> ans;
+        for(int i = 0; i < n; i++){
+            if(indeg[i] == 0)
+                ans.push_back(i);
+        }
+        
+        return ans;
+    }
+};