What this snippet does
BFS uses a queue to visit nodes level by level — the first path found to any node is the shortest (in unweighted graphs).
Expected output
[ 'A', 'B', 'C', 'D', 'E', 'F' ]
Why practise typing this
Typing algorithms code builds muscle memory for the symbols and indentation JavaScript uses most, which prose-based typing tests never cover. DevType measures your words per minute and accuracy on this snippet and tracks the individual characters you mistype, so later lessons can target them.
More JavaScript practice
- binary searchAlgorithms · intermediate
- merge sortAlgorithms · advanced
- two pointersAlgorithms · intermediate
- sliding windowAlgorithms · intermediate
- dynamic programmingAlgorithms · advanced
- flatten arrayAlgorithms · intermediate