Graphs are one of the most common questions that might show up in a technical interview. There are hundreds of graph questions that can show up in a programming interview, luckily there are only a handful of algorithms we need to really understand that will help us solve most of them.

In this video we will explain to you what the Breadth First Search algorithm is and show you how to implement it in 3 easy steps so that you can ace it in your coding interview.

Don't want to watch the video? Read our article instead! [ Ссылка ]

00:00 Introduction
00:21 Problem Introduction
00:38 Understanding the Problem
04:08 BFS Algorithm Walkthrough
06:08 BFS Algorithm Analysis
06:30 Implementing Clone Graph

свернуть