Halloween Sale
Unlock all premium questions for over 30% off
Minimum Vertices to Cover Directed Graph
Hard
Question
Picture n servers with ids 0 through n - 1, wired together by directed links. The links come as edges, where edges[i] = [u, v] means a signal can travel from server u to server v (but not back along the same link).
...
Asked at:Airbnb
More Airbnb interview questions
- Find Median In Large Unsorted Arraymedium
- Calculate Game Board Scoremedium
- Smallest Greater Number from Digitsmedium
- 2D List Iteratorhard
- Implement Refundshard
- Shortest Maze Pathmedium
- Collatz Sequencehard
- Most Cost Effective Menu Orderhard
OfferRetriever
Master technical interviews with real questions from top companies. Build your confidence and career.
LEGAL
© 2026 Purple Business Holdings LLC. All rights reserved. See Terms of Service.