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

[@GregHogg]

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

[@kedarkulkarni9464]

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

[@GregHogg]

Wow, this is amazing! Thanks so much! Thanks, I added the code, and will add timestamps soon.

[@Axel-tt9di]

Best explanation, clear and concise.

[@ANUMKHAN-d5v]

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

[@GregHogg]

Glad to hear it!

[@Rutik9999]

best problem to learn all 3 traversal techniques

[@christianjt7018]

Excellent explanation, thanks Greg!

[@GregHogg]

Glad you liked it :)

[@shantanukulkarni2413]

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

[@GregHogg]

I just got tired of it tbh. I did it for years and I needed to pivot

[@shantanukulkarni2413]

@@GregHogg which one to go for in 2024 purely from job market pov.

[@souviksen5177]

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

[@saurabhbhagat4528]

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

[@arsheyajain7055]

Awesome 🤩