← 💻 Coding & Engineering CraftNEXT IN CODING & ENGINEERING CRAFTTopological Sort and DAGs→
Core
Graphs: BFS, DFS, and Shortest Paths
A graph is nodes and edges, and most of the work is realizing a problem is a graph to begin with. BFS finds shortest paths in unweighted graphs and explores level by level, DFS goes depth-first and reveals connectivity and cycles, and Dijkstra handles non-negative weighted shortest paths with a priority queue. Applied-AI interviews test it because dependency graphs, retrieval graphs, and reachability questions are everywhere once you learn to spot them.
a free account unlocks the core curriculum tier · no card
RELATED CONCEPTS
PRACTICE THIS IN REAL QUESTIONS
Coding & DSAFind the length of the shortest transformation sequence from one word to another (Word Ladder).→Coding & DSAExplain BFS and DFS and when to use each, then detect a cycle in a graph.→Coding & DSANumber of Islands: connected components on a grid (flood fill).→Coding & DSASerialize and deserialize a binary tree.→SQL & Data EngineeringFind shortest paths and detect cycles in a graph stored as edges, using a recursive CTE.→Coding & DSAGiven a sorted list of words in an alien language, derive the order of its characters.→
COMPANIES THAT ASSUME THIS