Paths Subjects Questions Quizzes Pricing Search
Algorithms & Data Structures Advanced Pro

Graphs

The traversal toolkit behind connectivity, shortest paths, and dependency ordering

55 min read 0 views

A deep dive into graph algorithms for coding interviews: DFS, BFS, Union-Find, and Dijkstra's algorithm, applied to grids, dependency graphs, and weighted networks. You'll learn to recognize which tool a problem is asking for and implement each one cleanly under time pressure.

Practice questions (10)

  • Graph Deep Copy

    Intermediate
    View →
  • Count Islands

    Beginner
    View →
  • Matrix Infection

    Intermediate
    View →
  • Bipartite Graph Validation

    Intermediate
    View →
  • Longest Increasing Path

    Advanced
    View →
See all 10 questions →

We use cookies for product analytics to improve OmniAtlas. See our Privacy Policy.