Graph Concepts & Qns - 8 (Amazon, Microsoft..) : Kahn's Algorithm(Topological Sort using BFS)

[@ayushsenapati8420]

Kabhi socha nahi tha graph ka question khudse itne easily solve kar paunga . Thanks a lot bhaiya for such awesome playlist on graph❤ Yeh lijiye bhaiya aapka crown reh gaya tha👑

[@codestorywithMIK]

You made my day Ayush. Thank you so so much ❤️❤️❤️❤️

[@wearevacationuncoverers]

Aisa graph ka playlist na kabaai bana hai aur na ban paega. I give you my word. This is what a real teaching is. Someone correctly said he is the KING OF GRAPHS

[@pranavpranjal2717]

currently watching this playlist second time for revising things. this playlist is forever gold.

[@nageshwarmali9631]

kya baat hai bro currently i am following babbar graph series but your explanation level also HIGH GOOD evry line and evry consept you have cleared , 1 baat-> your "code explanation" ka koi javab nahi hai alg level hai akdam koi kahi se bhi sikh k aaya ho yaha aake vo nayi cheej sikhke hi jayeaga after some days you will become the great of this coding industries and teaching also i will recoment my all friends for channel

[@codestorywithMIK]

Wow Nageshwar. you made my day ❤️❤️❤️ Thank you so much

[@wearevacationuncoverers]

indeed

[@AlishaKhan-ww3io]

true

[@gaurimandot5788]

Best series of DSA . Thanks a lot bhaiya.

[@manishv.8167]

I am taking an oath that with you , I will be master in DSA by watching your each and every video of concepts. As Graph is running, similarly I will cover other topics which you will cover. Just to let you know because of you, I am able to make story and today problem I solved by thinking which DS I should used , really I am feeling WOW. Thanks !! And Never stop making videos and you also take a responsibility to make playlist of each and every topic by the end of this year, Please!

[@codestorywithMIK]

💪❤️

[@tommyshelby6277]

wtf bro, i never really felt that much clarity ever. you have some magic in your teaching

[@AlishaKhan-ww3io]

Never thought I would solve Graph and this graph playlist changed everything for me 😃 Thank you so much

[@JoyAcharyatvl]

It was as much as easy like your minimum spanning tree video. Very nice and easy to understand. I will never forget . Thanks Vai.

[@codestorywithMIK]

You are welcome! 😇❤️🙏

[@tutuimam3381]

Amazing explanation

[@yikes3807]

sir aapka video jo famouse log h unse bhi accha samaz me aata hai ekdum apna feel aata h thanku

[@codestorywithMIK]

Means a lot. Thank you so much 🙏😇

[@souravjoshi2293]

You are INCREDIBLE❣

[@sameerswankar]

Again, This is the best series

[@codestorywithMIK]

It means a lot to me Sameer 🙏🙏❤️❤️

[@thekindspill]

Legit explanation. This channel is a hidden gem

[@raunakgiri21]

For me: 1) topoSort using DFS: stack mein pehle mere baccho ko daalo, baad mein mujhe daalo. 2) topoSort using BFS (Kahns): inDegree zero hone par queue mein daalo.

[@ayusharyan2165]

fir se new year aane wala h or shuruat bhot achhi hone wali h. Thank Youuuuuuuuuuuuuuuuuu

[@Sandythecoder1010]

I solved it on my own!! WOW! Thank you so much sir!

[@jk-sm6qr]

Great

[@s78_EditZ]

you are the best thanks for such an amaxing explaanation❤❤❤❤❤

[@oqant0424]

Kahn's Algorithm was so scary earlier 😱😱 U made it a cakewalk Thanks❤❤

[@codestorywithMIK]

So glad to know ❤️🙏😇

[@b_01_aditidonode43]

thanks a lot for such clear explanation, I was able to convert your theory to code by my own because of the amazing intuition building...8/41 done !!

[@kashishkashyap6229]

again , no words. thanks a ton.❣

[@codestorywithMIK]

Thank you 😇🙏

[@nagmakhan3165]

Amazing

[@bollywoodboxoffice7017]

maza aa gaya bhai your writing is so good

[@gauravbanerjee2898]

8/40 done ✅ thanks a lot bhaiya❣

[@codestorywithMIK]

Keep it up 😇❤️🙏

[@manishv.8167]

After the Graph concept, Once it is finished then start DP, Tree, and so on, please

[@AlishaKhan-ww3io]

yes please. Start recursion also

[@RG-hm2er]

Thank you for the amazing video! Can you also link some questions related to the topic you teach? Thank you once again!

[@codestorywithMIK]

Thanks a lot. I will make videos on Qns related to each topic. Stay tuned Thank you ❤️❤️❤️

[@Sahilsharma-sk5vr]

good one

[@Ppvb6]

superb, too good to be true. Hats off. Khatam. Tata. Bye-Bye.

[@Nagar2024]

Thank you so much sir..for this video! Great explaination :) Just having 1 doubt, why we are not taking visited array here, and how we are still getting the right output ? And if I am taking visited array then, I am getting TLE error on gfg..why so? code : static int[] topoSort(int V, ArrayList adj) { int[] ans= new int[adj.size()]; int[] indegree = new int[adj.size()]; for(ArrayList arr : adj){ for(int a : arr){ indegree[a]++; } } boolean[] visited = new boolean[adj.size()]; Queue queue = new LinkedList(); for(int i=0;i

[@TanuKansal-nn4el]

Might be the reason,, we are pushing only when indegree = 0 and indegree is 0 only when it is unreachable from any other node,,, so once pushed into queue, it will never reach again.

[@apurav363]

🙏👍

[@prajwalshaw9217]

Hello sir could u kindly cover leetcode 851(loud and rich)...its a problem based on topological sort...but the question statement itself is very confusing and there is no good explanation on yt for this question . Thanks for a wonderful graph playlist.

[@pranavpranjal2717]

why we dont need a boolean vector of visited in this one. we used it in the bfs traversal earlier.

[@oqant0424]

8/40 done [23.10.23]

[@eprithvikushwah4754]

3 Jan , Happy Birthday

[@AnkitSingh-tm5dp]

Bhai holiday se jaldi aao🥲

[@sriyanandakuchimanchi4042]

if you are infront of me I would Bow down on my knees...i saw once and understood

[@dayashankarlakhotia4943]

Bfs KAHN'S. Class solution { static int[]topo sort (int v,Array list adj) { int interger =new int [v]; for(int i=0; i