Graph Coding Question - All Paths From Source To Target (LeetCode)

[@ishq_gunah_hai3179]

Love from Indian student. Recommended all my friends 🙂. Best explanation. I saw explanation and coded and my fear for graphs vanished. I always need initially a good explanation and you deliver the best 🔥

[@AlgosWithMichael]

Thats awesome! Graphs are intimidating at first for sure. Thanks for sharing, commenting, and watching my videos!

[@krishnachaitanya167]

Same here, his explanation is enough for me to pass all the test-cases on leetcode. Thanks Michael!!

[@IronPrometheus]

About implementing through BFS or DFS. Indeed their overall runtime and memory complexities are about the same. However, on BFS queue, it can consume far more heap memory for large graphs with a high degree outgoing edges. This is due to the fact that the queue stores tons of intermediate paths that potentially lead to nowhere at once. DFS, on the hand, keeps only one path that has not reached the target node yet (single backtrack path).

[@NotNotNithin]

I was watching a different video yesterday for the same problem and I couldn't understand the approach taken. After watching this I got to know how I can approach Graph problems. The way you write the diagram is the way you code. You made it seem so simple. Thanks. Kind request is to make videos on Leetcode Medium Hard problems of Google.🙏🙏🙏🙏 please!!!!

[@AlgosWithMichael]

That is exactly my goal, I'm glad you got use out of it!

[@jawadistube]

Hey Mate, Your videos are great and As a developer, I want to say that you are doing very well. You are also the best at coding and that's our pleasure that you make videos for us. The only thing I wanna mention here is that the input which you have taken is not correct at 0:33. In the question the input is [[1,2],[3],[3],[]] but you take [[1,2],[3],[1,3],[]]. However this is very informative

[@mihirk953]

Thanks a lot! It was a very easy to understand approach. I solved the problem using C++.

[@AlgosWithMichael]

Awesome, thanks for watching!

[@vandetpin4288]

+1 for very clear explanation of Time and Space complexity analysis !

[@AlgosWithMichael]

Anytime :)

[@harinijeyaraman8789]

Almost all other tutorials only show the DFS method, thanks for this video, great explanation ! Please make a playlist of Graph questions and DP questions.

[@AlgosWithMichael]

Appreciate the support!

[@vineethsai1575]

Great solution, Just want to point out that there is a backtracking solution which eliminates the need to copy over the path again and again. Which brings the time complexity down to O(N * 2^N)

[@fabusuyiayodeji7016]

this is super brilliant. best solution I've seen to this question

[@AlgosWithMichael]

Awesome, glad to hear :)

[@BryanJimenez1]

The solution I was looking for! I saw that people answered this question using backtracking or DP.

[@AlgosWithMichael]

Yep this is an easier way I think!

[@konstantinosblatsoukas3658]

Thanks for the explanation Michael!

[@275phuongvy]

great explanation! You deserve more subscribes. Please solve more easy and medium leetcode problems about graph too. Thank you.

[@AlgosWithMichael]

Thank you so much, more videos are on the way!

[@pavittarkumarazad3259]

Yeah! He explained it pretty well. I don't know about others but I'm sure this is the best explanation one could ever give for this question.

[@midasama3124]

Incredible solution! Thanks for the effort.

[@AlgosWithMichael]

Glad you like it! Thanks for watching

[@yasssh7835]

Thank you so much! Concise and short.

[@AlgosWithMichael]

You are very welcome!

[@AngadSingh97]

Really well explained. Thanks, I subscribed to your channel.

[@AlgosWithMichael]

Thanks for the sub!

[@m.movsar]

The best explanation! Thank you!

[@UCS_RheaRaviSharma-fs9bs]

Amazing explanation. Really thankful!!!!

[@AlgosWithMichael]

You are welcome! Thanks so much for watching!

[@sanjayizardar2263]

Great explanation Michael! Can you please some more complicated graph questions?

[@AlgosWithMichael]

Of course, let me know if you have any in mind! Thanks for watching

[@atuldubey8146]

Great explanation :)

[@ray811030]

TC analysis: 11:10

[@mrcgaming9306]

Very nice explanation bro thank you so much 👍

[@naveenraj2727]

Thank you Miguel. it was very easy to understand!

[@AlgosWithMichael]

Glad to hear that!

[@TheRuancarlo]

I want to see a solution for a undirected acyclical multigraph

[@rakeshgupta8901]

you made this so simple. thanks for explaining,

[@AlgosWithMichael]

Glad it helped!

[@srinivasanapps]

Thanks great explanation. How the given input is parsed and converted into int[][]? [[1,2],[3],[3],[]] -> {{1,2},{3},{3},{}}

[@babu1308]

I am looking for same :(

[@rivaille8867]

This can be done with topsort dp in linear time

[@chirag8627]

Great!! keep them coming!!

[@AlgosWithMichael]

More to come!

[@staubi2443]

Thanks for this solution!!!!

[@AlgosWithMichael]

Glad it helped!

[@karankanojiya7672]

Subscribed !! Respect ++

[@AlgosWithMichael]

Appreciated!

[@code7434]

Hi please add Shortest Bridge leetcode question. Basically concept of multi source shortest path

[@AlgosWithMichael]

I haven't seen this one before, thanks for letting me know!

[@code7434]

@@AlgosWithMichael actually realising multisource bfs is tough. So ur explaination will help a lot

[@baidya87]

awesome explanation! thanks a lot

[@AlgosWithMichael]

No problem man

[@SR-we1vl]

I Came I Saw I Subscribed!

[@AlgosWithMichael]

Wow thanks!

[@djnemo8488]

I am not able to execute the code. It shows error

[@rohitmathur9723]

Wow man you explained it really well!! Great work!

[@AlgosWithMichael]

Glad you liked it!

[@MrThepratik]

great explaination

[@AlgosWithMichael]

Thank you!

[@TeddyDeanShorts]

What if the result list isn't counted as "extra" space? How would you analyse the space complexity without the result list?

[@AlgosWithMichael]

If the result list didn't count and no recursion was being used, it would likely just be O(1) space.

[@rajeshb1504]

Can you please solve Longest Palindrome in given string?

[@AlgosWithMichael]

Definitely!

[@faiqarif5765]

Why can't this be solved using dp?

[@AlgosWithMichael]

Hmm maybe it can, but I don't know how to do it :p

[@heisenberg1844]

Amazing.

[@AlgosWithMichael]

Thanks man!

[@davidluong98]

thank you

[@AlgosWithMichael]

No prob, thanks for watching!

[@furkancevik933]

nice video

[@AlgosWithMichael]

Thanks!

[@soneshengg]

Sorry but time complexity didnt make much sense if you could go in more detail.

[@chodingninjas7415]

More graph problems

[@AlgosWithMichael]

More to come. Thanks for watching!