Graph Concepts & Qns - 9 (Flipkart, Amazon, Microsoft...) : Detect Cycle in Directed Graph using BFS

[@akshitajha1209]

I'll cry out of happiness😭😭😭 His explanations are music to ears. Graphs seem like butter, I just can't believe that I am able to do it!!

[@codestorywithMIK]

Thank you so much 🙂

[@wearevacationuncoverers]

You are the only who is capable of removing the fear of Graph even for beginners. People are going to remember you for sure.

[@priyajaiwal8072]

I thought i would drop the comment once i am where i wish to be but you know when you are at 77% percent of your preparation and you find such videos which makes coding so beautiful and you think to yourself it is fun yar, who says its tough?, you cant stop. Thank you so much for the work that you do and with the conviction that you do. Wish you all the subscribers and good things MIK : ) In the end, story is all that matters✨

[@codestorywithMIK]

You made my day. Thank you ❤️😇🙏

[@manishv.8167]

Mja to graph playlist jab se start Hui tabhi se aaraha hai brother, Thanks

[@codestorywithMIK]

Tysm ❤️❤️❤️

[@PoojaKumari-p4r1x]

Superbbbbbbbb Explaination Sir✨✨🎉🎉🎉🎉.

[@sumitgupta310]

bhaiya literally feel arha hai graph m , thanku so much

[@ashyy346]

Never thought graphs could be so easy, thanks a ton sir!

[@codestorywithMIK]

You're most welcome ❤️🙏

[@shivanshuamitabh831]

Legendary and the most underrated graph series of all time. Great explanation and even greater presentation style. Graphs never seemed so easy. 😍💕

[@souravjoshi2293]

It seems as if , you are giving me powers Thanks a lot man. I am gaining confidence in Graphs now

[@oqant0424]

Aapko jitna bhi thanks bolun kam hai......... U removed my fear from graphs and literally made me fall in love with DSA ❤❤

[@codestorywithMIK]

Means a lot to me. Thank you so much 🙏😇

[@wooldan7007]

killed bro fire!!!🔥🔥🔥

[@darkbgm4582]

You are amazing Teacher i loved the way you explain and teach

[@mayankraj8709]

Best Playlist to date I have found on the graph.

[@codestorywithMIK]

This means a lot to me ❤️

[@gaurimandot5788]

Amazing explanation bhaiya.

[@codestorywithMIK]

Thank you ☺️

[@gauravbanerjee2898]

9/40 done ✅ thanks a lot bhaiya😊❣

[@codestorywithMIK]

Thank you for watching 😇❤️

[@Sandythecoder1010]

You are THE best sir! Hands down!

[@oqant0424]

9/40 done ✅✅ [24.10.23]

[@b_01_aditidonode43]

thanks a lot for such clear explanation, kahn's algo made it too easy...9/41 done !!

[@udaytewary3809]

Really thankyou bhaiya your story telling way is 🤩❤️‍🔥❤️‍🔥💥💥💯💯

[@jk-sm6qr]

Thanks🎉

[@footballcreativeeverywhere260]

Great teacher forever 💝

[@codestorywithMIK]

Thank you! 😃😇🙏

[@thekindspill]

Thia playlist is a blessing

[@kashishkashyap6229]

amazing

[@codestorywithMIK]

Thank you 😇🙏

[@kartikforwork]

while studying kahn's algo i was thinking same what abt there is a graph where a node indegree won't become 0, now i know what does it mean...

[@emgineer_ak3301]

can we deteck cycle using topological sort using dfs

[@vivek.tiwary]

no need of separate count, we can return tps.Count < V;

[@akshatpandey2256]

cant we simply check if no indegree 0 vertex exists there's no cycle?

[@codeinertia]

For Input: 4 2 1 2 2 3 Your Code's output is: 1 It's Correct output is: 0 The code fails for this testcase

[@pradyumnmulegaon385]

no it runs perfectlt bro for this test case also see the code:-> bool isCyclic(int n, vector adj[]) { queueq; vectorindegree(n ,0); for(int u=0;u

[@PriyanshSharma-ri2iz]

have u got the reason why this error is coming i am facing the same issue?

[@dibbodas4116]

Explanation could have been better

[@codestorywithMIK]

Hi there, I would love to take feedbacks ❤️❤️🙏🙏 Kindly let me know where you felt i missed the details

[@m_.bsrikanth]

​@@codestorywithMIK your explanation is great bro I learnt a lot even though I know graphs before I learnt a lot from your videos I suggest you to communicate in English more rather than hindi because most of south people are not comfortable in hindi this is my only suggestion

[@whothefisyash]

u need to watch earlier lec on kahn algo