Find Eventual Safe States | 2 Approaches | Intuition | Leetcode-802 | MICROSOFT | Explanation

[@kishan.17]

You are great super Explanation and super knowledge about dsa .love u bro❤❤❤❤ pls keep making videos and teach ous bro 🙏 🎉🎉🎉🎉❤❤❤❤❤❤

[@codestorywithMIK]

Thanks a lot ❤️🙏😇

[@souravjoshi2293]

20:47 - This is what makes your channel different from literally every resource present out there on internet. Keep making such videos . thanks a lot

[@alokkumar4419]

Bro that BFS part is what makes you different from others... Nice explanation ❤

[@fashionvella730]

Most important fact of reverse in this approach is that by reversing the edges there will be no effect on the cycle in the graph.

[@adityacr7407]

There no need for vector isSafe as indegree of the nodes will be 0 in the BFS approach and we can traverse that indegree vector the safe nodes.

[@wearevacationuncoverers]

Legit explanation. Never gonna forget about it now

[@divyanshsagar]

The explanation of why we reversed the graph was good!

[@codestorywithMIK]

Thanks a lot 🙏🙏❤️

[@PoojaKumari-p4r1x]

Best Expalination on KZbin 🎯🎯🎉🎉🎉🎉

[@sachinmohanty4577]

Okay i am marking my attendance today also MIK ❤😂 ..nice explanation as usual

[@codestorywithMIK]

Thanks a lot ❤️🙏😇

[@anuppatankar4294]

BFS approach is awesome 👌🏻

[@codestorywithMIK]

❤️❤️😊

[@thekindspill]

20:44 damn true 🔥🔥🔥 You are best bro

[@yashgaur2470]

Excellent explanation Sir!! Thank you so much🙏

[@codestorywithMIK]

Thank you 😊 ❤️🙏

[@dikshantyadav1110]

nice explanation, please keep up the good work

[@codestorywithMIK]

Thank you so much 🙏🙏🙏

[@floatingpoint7629]

thanks for the explanation i was able to code it up using DFS approach.

[@codestorywithMIK]

Thank you for watching ❤️😊

[@ugcwithaddi]

BEST channel ever

[@anuj8855]

great explanation🤩

[@AlishaKhan-ww3io]

One of the best explanations 🔥

[@dayashankarlakhotia4943]

Good explanation with logic

[@codestorywithMIK]

Thanks a lot 😇🙏

[@dayashankarlakhotia4943]

Tc=(e+v); sc(v) e=edges; v=nodes

[@cricwhiz151]

nice explanation.can i ask one question how you gain so much depth knowledge on dsa or any resources can you suggest some tips it will real help full for me ?

[@codestorywithMIK]

I never did any paid course. I solve as many qns possible per topic. It helps

[@tutuimam3381]

Thanks❤

[@anshuraghav505]

nice explanation

[@Raj10185]

thanks for the explanation => it is really best

[@codestorywithMIK]

Thank you so much 😊❤️

[@Dev-gb3tk]

This is why I came to this video

[@codestorywithMIK]

🙏😇

[@xiaoshen194]

Bhai but why did u create that extra boolean array for safe during BFS? Why didn't u directly push u into some result int vector?

[@codestorywithMIK]

Because the result needs to be sorted according to the problem. If I directly push them, it is not guaranteed to go in sorted fashion.

[@vineettanwar7880]

thank you sir

[@codestorywithMIK]

Thank you for watching ❤️🙏😇

[@codeandtalk6]

I solved it on my own ❤❤

[@codestorywithMIK]

Awesome Yayy 🎉🎉🎉

[@xiaoshen194]

Nice👍👍

[@souravjoshi2293]

coool

[@anujhapriyapriya2863]

can we solve it with union find ? those nodes which are connected to terminal nodes will be ans?

[@kishan.17]

Bro how did u learn dsa which resources did u prefer for learning

[@codestorywithMIK]

I never used any paid course. They don’t teach the intuition I guess. I usually practice as more qns as possible

[@kuchbhi7811]

without LEETCODE premium compnay list for a particular questionn kaise check kr skte he ?

[@codestorywithMIK]

Lintcode.com GfG

[@Raj10185]

an chrome extension also available search for Big Omega leetcode

[@wearevacationuncoverers]

warning 🔥🔥🔥

[@manimanohar_001]

First view

[@ranvirvlog887]

sir please provide slide link

[@manimanohar_001]

Leetcode 92

[@AlishaKhan-ww3io]

++