← Back to Oracle

Graph Theory

4 questions

1Minimum Cost Path with Edge ReversalsMedium
Graph TheoryHeap (Priority Queue)Shortest Path
Solve →
2Count the Number of Houses at a Certain Distance IIHard
Graph TheoryPrefix Sum
Solve →
3Count the Number of Houses at a Certain Distance IIHard
Graph TheoryPrefix Sum
Solve →
4Minimum Cost Path with Edge ReversalsMedium
Graph TheoryHeap (Priority Queue)Shortest Path
Solve →