Skip to content

Glossary: Coding Interviews in JavaScript

BFS (breadth-first search)

Also written: BFS, BFS on a grid

A search that uses a queue to visit cells or nodes in order of distance from the start. On a grid it finds the fewest steps to a goal, such as a route across the warehouse floor.

Where the book teaches it

Related terms

GridDFS (depth-first search)QueueIn-bounds check