Minimum Number of Vertices to Reach All Nodes (LeetCode 1557)
MediumLeetCode 1557 · DFS · Google, Meta +1 · 16:26Minimum Number of Vertices to Reach All Nodes · With INTUITION · GOOGLE · Leetcode-1557 · Live CodeMy notes
Sign in to keep private notes on every station, with video timestamps.
Pause here and write your approach in two lines. Compare it with MIK's when the video ends.
Sign in to write your approach →About this video
Video solution for LeetCode 1557 Minimum Number of Vertices to Reach All Nodes by codestorywithMIK: Graphs, Medium. Topics: Graph Theory, Directed Acyclic Graph. Watch the explanation, then check the code and solve it on LeetCode.
- Difficulty
- medium
- Topics
- Graph Theory, Directed Acyclic Graph
- Patterns
- DFS
- Chapter
- Graphs
- Duration
- 16:26
Related problems
- Graph Concepts & Qns - 4 (Microsoft, Amazon, Flipkart) : Detect Cycle in Undirected Graph using DFS
- Number of Provinces - (Google, Microsoft ) (LeetCode 547)
- Course Schedule (LeetCode 207)
- Course Schedule-II (LeetCode 210)
- Is Graph Bipartite ? (LeetCode 785)
- Strongly Connected Components
- Hierholzer's Algorithm (LeetCode 2097)
- Diameter Of Undirected Graph (LeetCode 1245)