bfs
Applied AI interview questions tagged bfs, across every topic.
5 questions · 0 unlocked for you
Concepts behind "bfs"
The curriculum that explains the ideas these questions test.
Foundational
Stacks and QueuesA stack is last-in-first-out and a queue is first-in-first-out, and most interview value comes from recognizing which problems hide one. The high-leverage patterns are the monotonic stack for next-greater-element and stock-span problems, queues for breadth-first traversal, and building one structure from the other (two stacks for a queue, a deque for both). Applied-AI interviews probe this because the recognition skill (bracket matching, span, BFS frontier) is the actual test, not the data structure itself.💻 Coding & Engineering Craft
Core
Trees, BSTs, and TraversalA binary tree links each node to up to two children, and a binary search tree adds the invariant that everything left is smaller and everything right is larger, which gives O(log n) search on a balanced tree. The traversal skills interviews test are the three depth-first orders (pre, in, post), breadth-first level order, and switching between recursion and an explicit stack. Applied-AI interviews probe this because in-order traversal of a BST yields sorted output, and the recursion-to-stack conversion is the same skill behind iterative DFS everywhere.💻 Coding & Engineering CraftSign in
Core
Graphs: BFS, DFS, and Shortest PathsA graph is nodes and edges, and most of the work is recognizing that a problem is a graph in the first place. BFS finds shortest paths in unweighted graphs and explores level by level, DFS explores depth-first and exposes connectivity and cycles, and Dijkstra handles non-negative weighted shortest paths with a priority queue. Applied-AI interviews probe it because dependency graphs, retrieval graphs, and reachability questions are everywhere once you learn to see them.💻 Coding & Engineering CraftSign in