Find if Path Exists in Graph - Leetcode 1971 - Graphs (Python)

Please check my playlists for free DSA problem solutions:

My Favorite Courses:

Data Structures & Algorithms:

Python:

Web Dev / Full Stack:

Cloud Development:

Game Development:

SQL & Data Science:

Machine Learning & AI:

[GregHogg]

Master Data Structures & Algorithms For FREE at AlgoMap.io!

[kedarkulkarni]

I have gone through soooo many videos from youtubers who have done elaborate explanations on DFS, BFS for over 2+ hours but none of them ACTUALLY write proper code to explain how everything works. What is the point of understanding BFS, DFS in theory when you can't write code for it when the time comes. This video is ALL YOU NEED to understand DFS and BFS in graphs.
Thank you soooo much for finally giving a video that is clean, to-the-point, doesn't overexplain, doesn't explain "types of graphs" etc. while explaining BFS and DFS. There is so much BS in tech-youtube space and your channel is a breath of fresh air. Kudos to you <3

Small feedback:
1) The code for this was not present in your git repo (please correct me if am wrong)
2) Try to add timestamps so that we can switch between codes to understand how each compares against the other

[ANUMKHAN-dv]

Amazing to-the-point explanation. Thanks @GregHogg!

[Rutik]

best problem to learn all 3 traversal techniques

[souviksen]

What would be the most efficient way to solve this question?

[shantanukulkarni]

Hi greg,
Great that you have been consistently uploading DSA problems. But I wonder what made you switch from posting data science content.

[saurabhbhagat]

Isn't the space complexity O(n^2) ? If the graph is fully connected, the number of items to store is n(n-1)