Engrain by ByteRush

DSA.11 3 concepts

Graphs

Traverse graphs and grids; order dependencies; group components.

  1. DSA.11.01Pattern 14: Graph traversal (BFS/DFS on graphs and grids)CoreMid-levelBeing written
  2. DSA.11.02Pattern 15: Topological sortCoreMid-levelBeing written
  3. DSA.11.03Pattern 16: Union-find (disjoint set) + Weighted shortest paths (awareness)Mid-levelBeing written

Interview questions in this module

  1. Count the islands in a grid. What is the complexity?
  2. How do you detect a cycle in a directed graph?
  3. Explain topological sort and a real frontend use of it.
  4. When would you use union-find instead of BFS?
  5. Why does BFS give the shortest path in an unweighted graph?