This channel deserves lot of subscribers, nice content I am 10 yrs working experience and still clearing my concepts by watching his channel Great work
just a correction at 7:12 on line 82 it will be Integer instead of int , if u all are doing it on gfg (otherwise u will get runtime error for testcase 69)
Another thing is this code can go wrong too. This code may give answer 0,3,1,4,2,5 which is not a topological order because in graph 2->3 is there so in topological order 2 should come before 3. So the code logic is wrong. Correct me if I am wrong.
Explanation of edge from 2->1 (at 1:30 ) - "2 ki dependency hai 1 ke upar. Agar 1 ko khatam hona hai toh 1 ko pehle 2 ko khatam karna hoga, uske baad hee 1 start ho sakta hai". That actually means 1 is dependent on 2 and not the other way round.
great video bhaiya ... i am really blessed that u are providing such courses for free so that many of us who cannot afford to pay for dsa courses can gain free knowledge from ur videos and crack good companies !!!!!!!!! love u bhaiya ❤❤❤❤❤❤,,, Before this I was scared of dsa specially graph and tree but now I can enough confident to solve those questions
At 1:46 - "Jise upar sabse zyada log dependent hai uss kaam ko khatam karo, fir usko jispe sabse kam log dependent hain". Kitne current job pe dependent hain woh matter nahi karta, par woh job khud kispe dependent hai woh matter karta hai. You can only perform the job which is not dependent on any other jobs first. After that you will pick other jobs which are dependent on this job. And so on. I appreciate the effort that you have put into making this but I found some of these things rather confusing. Picking up a book to revise the basics worked better for me.
Another thing is this code can go wrong too. This code may give answer 0,3,1,4,2,5 which is not a topological order because in graph 2->3 is there so in topological order 2 should come before 3. So the code logic is wrong. Correct me if I am wrong.
This channel deserves lot of subscribers, nice content I am 10 yrs working experience and still clearing my concepts by watching his channel Great work
you are too good man , short and crisp for advance developers !
There isn't a single time that I came to this channel returned without understanding the concept. Thank You Boss
Been waiting for a long time for this playlist to end please finish it asap✌️
just a correction
at 7:12 on line 82 it will be Integer instead of int , if u all are doing it on gfg (otherwise u will get runtime error for testcase 69)
Can you specify why this anomaly occurs?
@@priyanshumohanty5261 because int is storing that data where as Integer is storing the address of the data
Another thing is this code can go wrong too. This code may give answer 0,3,1,4,2,5 which is not a topological order because in graph 2->3 is there so in topological order 2 should come before 3. So the code logic is wrong. Correct me if I am wrong.
@@David-mk8kh how did you put 5 at last?
@@paraskumar693 yes that's what I am saying, 5 shouldn't come in last, but this code gives 5 at last in the answer
Thanks a lot been waiting for this!
Explanation of edge from 2->1 (at 1:30 ) - "2 ki dependency hai 1 ke upar. Agar 1 ko khatam hona hai toh 1 ko pehle 2 ko khatam karna hoga, uske baad hee 1 start ho sakta hai".
That actually means 1 is dependent on 2 and not the other way round.
great video bhaiya ... i am really blessed that u are providing such courses for free so that many of us who cannot afford to pay for dsa courses can gain free knowledge from ur videos and crack good companies !!!!!!!!! love u bhaiya ❤❤❤❤❤❤,,, Before this I was scared of dsa specially graph and tree but now I can enough confident to solve those questions
Thank you
Thankyou soo much sir for this explanation and dry run is amazing
very nice explanation bhaiya
At 1:46 - "Jise upar sabse zyada log dependent hai uss kaam ko khatam karo, fir usko jispe sabse kam log dependent hain".
Kitne current job pe dependent hain woh matter nahi karta, par woh job khud kispe dependent hai woh matter karta hai.
You can only perform the job which is not dependent on any other jobs first. After that you will pick other jobs which are dependent on this job. And so on.
I appreciate the effort that you have put into making this but I found some of these things rather confusing. Picking up a book to revise the basics worked better for me.
Thanku bhaiya from ranchi
@@ChandraShekhar-by3cd from Chandni chowk
Thanks You bhai ... Osm❤️❤️
thank you brother😍
Sir background video recorder app se hum Jo video record karte hain vo video app banane wale ke pass bhi save hota hai kya
Nice explanation.
superb
Thanku
Bro, your content is superb! if you can go little slow , then it would be more easier to understand things..
Thanks bro .
Present sir ...
#blindrooms
I am so excited 😃
Video that i am looking for thanks bhaiaya minimum spanning tree next vidoe bhaiaya please
Another thing is this code can go wrong too. This code may give answer 0,3,1,4,2,5 which is not a topological order because in graph 2->3 is there so in topological order 2 should come before 3. So the code logic is wrong. Correct me if I am wrong.
why not queue ?
along with story, copy paste code, a git link would help to look the code you have written...
Bhaiya when you start blockchain development course. I am waiting for it please it's a humble request by me 🙏🙏🙏🙏🙏🙏🙏🙏
❤️❤️❤️
🙏👍
This explanation is not working for second example.
Bhaiya plz plz plz plz ek Web development ka course nikal dijiye na full stack development ka
I want complete code
code smjhane ka treeka thoda kezual h
Bro english plsss