Using Breadth First Search with Graphs in Coding Interviews
Many graph interview problems typically involve traversing a graph. One common way of doing this is by using a breadth first traversal (BFS). In this video we will cover the fundamentals of BFS, how to implement a BFS for graphs using javascript and walkthrough sample interview problems.
1:20 Learning Objectives
2:30 What is a breadth first traversal
6:54 Code implementation
16:38 Time and space complexity
18:23 Finding the shortest path
20:58 Using BFS in an interview question
35:40 Recap
If you need a refresher on Graphs, check out our first video of this series here: • Algorithms: Graph Data Structure with...