Topological sort | Course schedule 2 | Leetcode

  Рет қаралды 92,839

Techdose

Techdose

Күн бұрын

Пікірлер: 206
@codestorywithMIK
@codestorywithMIK 4 жыл бұрын
You teach a topic and then you solve a question based on that topic. This is the best approach of teaching. Thanks
@techdose4u
@techdose4u 4 жыл бұрын
Welcome
@neghatnazir1668
@neghatnazir1668 4 жыл бұрын
@@techdose4u hey i am a bit confused would you pls clear it? if we start at node 4 the order comes out to b 5 3 0 4 1 2 which is not correct i guess? would pls explain this to me i am not getting it?
@willturner3440
@willturner3440 4 жыл бұрын
@@neghatnazir1668 you are correct
@sreesayihrudai9541
@sreesayihrudai9541 3 жыл бұрын
@@neghatnazir1668 Try to run a loop from starting vertex to end vertex you will get the answer
@manishkumar-qn6lx
@manishkumar-qn6lx 2 жыл бұрын
​@@techdose4u Even if there exists a loop, still there is the possibility to cover all the courses. Ex. [[0,1], [2,0], [2,1], [3,1], [3,2]]. ( [0, 1], indicates that to take course 0 you have to first take course 1 ) In the above example, there exists a loop but still, we can complete all the courses in the following order : [0,2,1,3].
@sainathy9225
@sainathy9225 4 жыл бұрын
@techdose, you are doing great job . I used to follow nich white and Kevin naughton . Now iam waiting for your videos. Keep doing!
@techdose4u
@techdose4u 4 жыл бұрын
Thanks :)
@bostonlights2749
@bostonlights2749 4 жыл бұрын
Same for me as well
@vman049
@vman049 4 жыл бұрын
Same. @techdose completely dominates them!
@JayDonga
@JayDonga 4 жыл бұрын
Great video, thank you for clear explanation. One addition here, instead of doing double work (pushing elements to stack and popping every element to get answer), you can add each new element on front of LinkedList and then return the LinkedList.
@amith1989
@amith1989 4 жыл бұрын
Quick, crisp and clear!! Fantastic way of explaining Topological sorting in 13 minutes.!
@techdose4u
@techdose4u 4 жыл бұрын
Thanks
@greymatters22
@greymatters22 7 ай бұрын
Thank you so much this channel, this channel focusses on solving all difficult problems based on advanced concepts. Love it
@harshbhadoria7200
@harshbhadoria7200 3 жыл бұрын
The day before yesterday I came to youtube for a solution to a question, as usual, randomly I picked your video. I don't know what happened after that day, whenever I search for the question on youtube I'm writing Techdose at the end. Conclusion: The way you teach and make us understand every topic is too good.
@techdose4u
@techdose4u 3 жыл бұрын
Thanks 😊
@sohamshinde1258
@sohamshinde1258 3 жыл бұрын
Best in class channel with the best in class explanation. Thankyou so much.
@techdose4u
@techdose4u 3 жыл бұрын
Welcome :)
@harshithg5455
@harshithg5455 3 жыл бұрын
Super video! I applauded for ₹200.00 👏👏👏
@techdose4u
@techdose4u 3 жыл бұрын
Thanks for supporting ❤️
@harshithg5455
@harshithg5455 3 жыл бұрын
@@techdose4u Thank you for the remarkable videos 😀
@techdose4u
@techdose4u 3 жыл бұрын
Welcome :)
@sakshamgupta2740
@sakshamgupta2740 3 жыл бұрын
graph videos are a real delight. Thanks for the content
@techdose4u
@techdose4u 3 жыл бұрын
Welcome:)
@rakeshsahni_
@rakeshsahni_ 4 жыл бұрын
This video Clear all my doubts regarding topological sort, thank you sir
@sharadmaheshwari5319
@sharadmaheshwari5319 4 жыл бұрын
your explanations goes smoothly in my mind, thanks for help !
@techdose4u
@techdose4u 4 жыл бұрын
Welcome :)
@MarioFernandez-hx1cm
@MarioFernandez-hx1cm 2 жыл бұрын
in three hours ive got my last exam at my carrer as engeneer, and this helped a lot. Hopepefully ill aprove, thanks a lot
@shridharsarraf2188
@shridharsarraf2188 3 жыл бұрын
This is best playlist on KZbin to learn Graphs ❤❤❤❤
@techdose4u
@techdose4u 3 жыл бұрын
Thanks ☺️
@shivammaniharsahu1228
@shivammaniharsahu1228 4 жыл бұрын
really good one keep sharing such vedios
@joydeepbhattacharjee5305
@joydeepbhattacharjee5305 3 жыл бұрын
one of the best channel for CS in youtube...thank u so much for such awesome contents... and keep helping us like this..
@techdose4u
@techdose4u 3 жыл бұрын
Sure. Thanks :)
@noobninja4882
@noobninja4882 4 жыл бұрын
perfect explanation sir, thanks a lot , following your graph series from the beginning , please continue this as i am learning a lot from this, and graph is my biggest fear
@techdose4u
@techdose4u 4 жыл бұрын
Okay sure.
@poojanshah9302
@poojanshah9302 3 жыл бұрын
Very thorough explanation. I am always looking for your explanation before solving any Leetcode problem.
@techdose4u
@techdose4u 3 жыл бұрын
Great :)
@bostonlights2749
@bostonlights2749 4 жыл бұрын
Quality content every time
@techdose4u
@techdose4u 4 жыл бұрын
😁
@fadiahetrakeshkumar9454
@fadiahetrakeshkumar9454 4 жыл бұрын
Nice video Best video for kahn algorithm
@techdose4u
@techdose4u 4 жыл бұрын
Thanks
@pepetikesavasiddhardha7852
@pepetikesavasiddhardha7852 2 жыл бұрын
awesome explination of topological sort algorithm
@amitavamozumder73
@amitavamozumder73 3 жыл бұрын
in 4:00 if I start from node 3, then the order will get messed up, right?
@shagunlamba6481
@shagunlamba6481 4 жыл бұрын
great explanation, recommending to everyone
@techdose4u
@techdose4u 4 жыл бұрын
Thanks :)
@JohnWick-kh7ow
@JohnWick-kh7ow 3 жыл бұрын
Using recursion- bool isCyclic(vector adj[],vector& vis,vector& order,int curr){ if(vis[curr]==0){ return true; } if(vis[curr]==-1){ vis[curr]=0; for(auto e:adj[curr]){ if(isCyclic(adj,vis,order,e)){ return true; } } order.push_back(curr); vis[curr]=1; } return false; } vector findOrder(int numCourses, vector& prerequisites) { vector adj[numCourses]; vector vis(numCourses,-1); vector order; for(int i=0;i
@spetsnaz_2
@spetsnaz_2 4 жыл бұрын
Such simple and elegant explanation can only be expected on TECH DOSE🍺
@techdose4u
@techdose4u 4 жыл бұрын
😁
@mwshubham
@mwshubham 3 жыл бұрын
How could something be such easy. Thanks 😊🙏
@techdose4u
@techdose4u 3 жыл бұрын
Welcome 😊
@kailashjangir1530
@kailashjangir1530 3 жыл бұрын
what if in starting we goes to node 3 rather than going to 2 in dfs, then answer would be changed na?
@FWTteam
@FWTteam 3 жыл бұрын
In search this was 3rd result, I'm glad I chose this.
@meghamalviya8495
@meghamalviya8495 4 жыл бұрын
Thank you for great explanation..your approach to explain problems is best!
@AmanGupta-ud6sy
@AmanGupta-ud6sy 4 жыл бұрын
Amazing video.....best explanation.
@techdose4u
@techdose4u 4 жыл бұрын
Thanks
@agileprogramming7463
@agileprogramming7463 4 жыл бұрын
Wonderfully explained as always!
@techdose4u
@techdose4u 4 жыл бұрын
Thanks agile :)
@sheldon9415
@sheldon9415 4 жыл бұрын
Such a good and clear explanation ! Thank you for the time you put in making this awesome video!
@techdose4u
@techdose4u 4 жыл бұрын
Welcome :)
@iampatelajeet
@iampatelajeet 3 жыл бұрын
Amazing way of teaching bro, loved it.. Keep it up. Thanks!
@techdose4u
@techdose4u 3 жыл бұрын
Thanks ☺️
@galeforceonline3847
@galeforceonline3847 4 жыл бұрын
Thanks. its good that you explain the subject using pseudo code aswell.
@techdose4u
@techdose4u 4 жыл бұрын
Welcome
@pranjalgupta9427
@pranjalgupta9427 4 жыл бұрын
Very nice explanation 👍👏😊
@techdose4u
@techdose4u 4 жыл бұрын
Thanks
@pcccmn
@pcccmn Жыл бұрын
This approach is accepted by LC. Naturally because of the method `detectCycle`, the solution is beaten by many who got it done within 1 dfs method..But honestly, this solution should be taught first before attempting NeetCode's. This solution is way simpler to understand and implement!
@vidyakore3930
@vidyakore3930 3 жыл бұрын
thanks a lott, explained so nicely... keep making such videos!!
@techdose4u
@techdose4u 3 жыл бұрын
Thanks
@electric336
@electric336 2 жыл бұрын
Very helpful video. You explained it very well.
@deepakjoshi4374
@deepakjoshi4374 Жыл бұрын
I solved this Course Schedule I/II QS using the concept of Detect Cycle in a Graph (Using Colour Method). If there is a cycle you will not be able to complete the courses. else you can always take all the courses. For printing the courses, you can put into an array when you visited all its descendants.
@kunalsoni7681
@kunalsoni7681 4 жыл бұрын
😊😊😇😇☺️.. great video
@techdose4u
@techdose4u 4 жыл бұрын
Thanks
@shashanksinha6966
@shashanksinha6966 3 жыл бұрын
there is an extra recursive call to check cycle , we can do it using bfs in less time complexity
@techdose4u
@techdose4u 3 жыл бұрын
👍🏼
@jineshdave6451
@jineshdave6451 3 жыл бұрын
Best explanation ✨✨
@techdose4u
@techdose4u 3 жыл бұрын
Thanks :)
@manmeetsingh4272
@manmeetsingh4272 3 жыл бұрын
In the given example, from node 0 you first traversed to 2 then to 3 so the stack will be { 2, 1, 3, 0, ....} but if we traversed node 3 first before 2 then the stack will be { 1, 3, 2, 0, ....} as we see the stack is not in topological order. Because when we run our program in pc we don't know what node will be traversed first. Can you explain this case?
@shaziasamreen8584
@shaziasamreen8584 4 жыл бұрын
Excellent Explanation..... Please upload leetcode daily challenge questions also..Your videos were very helpful..
@techdose4u
@techdose4u 4 жыл бұрын
Thanks :)
@AyushPandey0
@AyushPandey0 4 жыл бұрын
Excellent explanation sir, keep uploading more videos on graph problem.
@techdose4u
@techdose4u 4 жыл бұрын
Thanks
@anmolwadali9227
@anmolwadali9227 4 жыл бұрын
gud explanation !! Plz Make videos on Minium spanning tree kruskal & prims algo
@techdose4u
@techdose4u 4 жыл бұрын
It will eventually come. Making videos topicwise in order.
@neerajpant4071
@neerajpant4071 4 жыл бұрын
last few seconds was awesome it's more like listening to an terms and conditions for an insurance policy 🤣😄
@techdose4u
@techdose4u 4 жыл бұрын
😅 I just want to wrap the unnecessary talks quickly 😅
@neerajpant4071
@neerajpant4071 4 жыл бұрын
@@techdose4u hehehe..correct Nice explanation. Always worth watching your videos.👍
@techdose4u
@techdose4u 4 жыл бұрын
Thanks.
@akm1237
@akm1237 4 жыл бұрын
Hello sir. Does it matter which edge we start with for the topological sort? Say we begin with 3, wouldn't 3 come before 2 in the stack?
@aparnamittal8653
@aparnamittal8653 3 жыл бұрын
No, it does not matter. 3 will come before 2 in stack but when we pop elements, it will result in coming at end in the order which is correct.
@anumonto
@anumonto 4 жыл бұрын
simple and clear explanation.. Great!.
@techdose4u
@techdose4u 4 жыл бұрын
Thanks
@superneutral1663
@superneutral1663 2 жыл бұрын
brilliant explanations,love all your videos
@pranjalgupta9427
@pranjalgupta9427 4 жыл бұрын
Can i also start from other vertex rather than 0?
@manishkumar-qn6lx
@manishkumar-qn6lx 2 жыл бұрын
​ @TECH DOSE Even if there exists a loop, still there is the possibility to cover all the courses. Ex. [[0,1], [2,0], [2,1], [3,1], [3,2]]. ( [0, 1], indicates that to take course 0 you have to first take course 1 ) In the above example, there exists a loop but still, we can complete all the courses in the following order : [0,2,1,3].
@techdose4u
@techdose4u 2 жыл бұрын
There is no cycle in your graph :)
@davngo
@davngo 4 жыл бұрын
Your explanations and solutions are so beautiful.
@techdose4u
@techdose4u 4 жыл бұрын
Thanks
@yihongliu3850
@yihongliu3850 3 жыл бұрын
really nice and clear
@techdose4u
@techdose4u 3 жыл бұрын
Thanks Yihong :)
@rajatgarg6859
@rajatgarg6859 2 жыл бұрын
It was amazing ,thanks buddy :)
@thedisciplinedguy
@thedisciplinedguy 4 жыл бұрын
Doing a great work brother... Keep this spirit up... Your videos are really helpful.. 👌😊😊
@ayyappareddy4461
@ayyappareddy4461 4 жыл бұрын
Super explaination sirr
@techdose4u
@techdose4u 4 жыл бұрын
Thanks
@willturner3440
@willturner3440 4 жыл бұрын
Thanks sir for such a great explanation, genius 🥰
@techdose4u
@techdose4u 4 жыл бұрын
Welcome :)
@prasannakumarz
@prasannakumarz 4 жыл бұрын
very good explanation
@techdose4u
@techdose4u 4 жыл бұрын
Thanks
@mr_tpk
@mr_tpk 3 жыл бұрын
Awesome 🔥🔥🔥
@josevalbuena9423
@josevalbuena9423 3 жыл бұрын
Why is the motivation to perform Khan’s algorithm/Topological Sort with a DFS approach to solve this problem while in the explanation of the topic is based of BFS? What’s the reason? Can both approaches be used to apply Topological sort?
@smartwork7098
@smartwork7098 5 ай бұрын
Great work, man!
@be_like__prateek
@be_like__prateek 4 жыл бұрын
U r just awesome 💕
@techdose4u
@techdose4u 4 жыл бұрын
Thanks :)
@nayanjain5761
@nayanjain5761 3 жыл бұрын
In 1st video CS-I (Course schedule I) you created ajd by adj[i[0]].push_back(i[1]); i.e. 0->1 , and here inverse adj[i[1]].push_back(i[0]); 1->0. Also I checked for CS-I adj[i[1]].push_back(i[0]); is also passing, please explain. Thanks
@techdose4u
@techdose4u 3 жыл бұрын
If you are checking cycle then it doesn't matter how you take. It should be same for all the edges
@nayanjain5761
@nayanjain5761 3 жыл бұрын
@@techdose4u Thanks for this quick response and and all amazing content.
@darshansimha2166
@darshansimha2166 4 жыл бұрын
Amazing Explanation!
@techdose4u
@techdose4u 4 жыл бұрын
Thanks
@vishal40007
@vishal40007 2 жыл бұрын
I didn't think of using the stack. What is the thought process for solving the problem? How did you come up with stack?
@shubhamagarwal2998
@shubhamagarwal2998 3 жыл бұрын
7:43 this is not 100% necessary that nodes with outgoing degree=0 is comes at last .... like if in this example 0->{2,3) dfs(0)->dfs(3)->dfs(1) o/p stack = [1,3 dfs(0)->dfs(2) o/p stack = [1,3,2
@vamsiKrishna96
@vamsiKrishna96 4 жыл бұрын
Tech Dose, Awesome Explanation. Your reach would increase if you can share the solutions in java.
@techdose4u
@techdose4u 4 жыл бұрын
Yea...but I think people should focus on learning logic and implement themselves. Already codes are available in all languages.
@vamsiKrishna96
@vamsiKrishna96 4 жыл бұрын
@@techdose4u Agreed! Great, explanation, Man! Cheers!
@intelligentprogrammer
@intelligentprogrammer 3 жыл бұрын
Very well explained the logic :)) But I could not get one thing in the code--> How are we making adjacency list?? //Make adjacency list for(int i=0;i
@codebits2120
@codebits2120 3 жыл бұрын
Thanks 😊
@techdose4u
@techdose4u 3 жыл бұрын
Welcome
@pranavsharma7479
@pranavsharma7479 4 жыл бұрын
thanks for your work
@techdose4u
@techdose4u 4 жыл бұрын
Welcome
@Learner010
@Learner010 4 жыл бұрын
very nicely explained !!!
@techdose4u
@techdose4u 4 жыл бұрын
Thanks
@afnaanrafique366
@afnaanrafique366 2 жыл бұрын
Why is simple BFS not a solution to this problem?
@gaurangmittal5563
@gaurangmittal5563 4 жыл бұрын
Sir why did u used a graph coloring method for a detecting cycle in a directed graph, as in your vidoe you have used another approach.
@techdose4u
@techdose4u 4 жыл бұрын
Graph Coloring is simple and works in O(V+E) otherwise we will have to use stack.
@supratikk
@supratikk 4 жыл бұрын
I have implemented the same algo but just used the cycle detection method shown by you in the "course schedule1" problem. But its giving me a time Limit Exceeding error. Is that the reason why you slightly tweaked the cycle detention method in this problem?
@techdose4u
@techdose4u 4 жыл бұрын
I don't exactly remember the reason 😅
@rahulchudasama9363
@rahulchudasama9363 4 жыл бұрын
Awesome explaination, One suggestion Topological sort explaination video should come before the Reconstruct Itinerary video. So that flow can be maintained.
@techdose4u
@techdose4u 4 жыл бұрын
Okay i will reorder. Thanks for letting us know.
@tech_wizard9315
@tech_wizard9315 4 жыл бұрын
1) m a fresher, working in IT company of Jodhpur(9 hours job). If I prep DSA with c++ , 3-4 hrs each day for 3 months(leetcode) , can I gt job at Google,FB, Apple ? If not, then hw much time/months need? 2) If.i have one project in my resume, is it enuf for project round of FAANG
@techdose4u
@techdose4u 4 жыл бұрын
You can crack job at AMAZON , Microsoft with this preparation but Google and apple requires you to distinguish yourself from the rest. Your resume should show what sets you apart from the rest. This prep is done by thousands of jobseekers and hence you need either an exceptional coding profile or an exceptional dev profile or both in a balanced way.
@tech_wizard9315
@tech_wizard9315 4 жыл бұрын
@@techdose4u is one project enuf?
@ManojKumar-so9kw
@ManojKumar-so9kw 4 жыл бұрын
@@tech_wizard9315 nope man it wont be enough at any day for any of the product based companies
@techdose4u
@techdose4u 4 жыл бұрын
@@tech_wizard9315 one project is enough but it depends on what work you had done, the complexity and level of responsibility you were handling and the amount of effort you put. This defines your character as an SDE. Don't worry if you have 1 project, but the important thing is your dedication alongwith complexity and level of ownership of your project.
@exodus5948
@exodus5948 4 жыл бұрын
Bro , I am in a same situation 2020 batch and more from electronics batch from a tier 3 college, But I suggest you must make 2-3 Projects, OtherWise interviewer is definitely going to grill a lot. Best of luck for your preparations.
@learnfromramayan8176
@learnfromramayan8176 4 жыл бұрын
sir why cant we push the processed node and return answer following the exact method you taught in course schedule i. when we make a course processed=1 at that time why cant we push and add to result? Thank you in advance
@ShubhamKumar-zy7wy
@ShubhamKumar-zy7wy 4 жыл бұрын
Bhagwan hai bhai ye
@techdose4u
@techdose4u 4 жыл бұрын
😅
@kiranathavanad8050
@kiranathavanad8050 2 жыл бұрын
good one
@Cat-uk2jx
@Cat-uk2jx 2 жыл бұрын
Hello! I was doing this exercise I started with 4to 2 then I went to 4to 1. I then restarted at 5 to 0 to 3 and I got the following result 5,0,3,4,1,2. Is this correct? I read that one can start with any node (not just 5 or 4). Also I saw another comment with I different topological ordering which I also got 5,0,3,4,2,1. Can anyone explain why these are wrong? I am a beginner and I am having some difficulty grasping this concept. Thank you!
@ashishg656
@ashishg656 4 жыл бұрын
Great content :)
@swagatpatra2139
@swagatpatra2139 4 жыл бұрын
What about loops in the schedule? We need to return an empty array in that case.
@arindamchakraborty5880
@arindamchakraborty5880 2 жыл бұрын
@TECH DOSE I am having one doubt, Can we write 0 before 4 in the top sort? like 5, 0, 4 likewise? Please clarify.
@i_mchick5311
@i_mchick5311 3 жыл бұрын
Hello sir ! can u also share the notes that u write while teaching ??
@AmarKumar-vo2bv
@AmarKumar-vo2bv 4 жыл бұрын
Please make video on finding articulation point
@techdose4u
@techdose4u 4 жыл бұрын
It will come in connectivity topic. I am covering topicwise. Have patience.
@ameynaik2743
@ameynaik2743 3 жыл бұрын
Nice video. How did you find cycles in the graph?
@Sportamrina
@Sportamrina 3 жыл бұрын
watch the course schedule video - it checks for cycles in the graph
@thiyagarajanr225
@thiyagarajanr225 4 жыл бұрын
Content at its best! How much hours did you spend in making the videos bro? Efforts behind the scenes matters a lot! Usually i dont comment in any videos, but i used to comment to value your efforts 💖
@taskmaster4824
@taskmaster4824 3 жыл бұрын
buddy it is showing TLE in graph coloring ??
@vinitraj6268
@vinitraj6268 4 жыл бұрын
At 4:29 you started from node 0.....but I think we can start from any node....
@exodus5948
@exodus5948 4 жыл бұрын
I think within few months you are going to join google. :D, Loved your intuition behind problems. Please also make videos on Greed Approach
@techdose4u
@techdose4u 4 жыл бұрын
After graphs I am planning on doing DP + GREEDY mixed :)
@iSumitYadav
@iSumitYadav 4 жыл бұрын
TopoSort and Cycle finding can be combined to a single function only
@techdose4u
@techdose4u 4 жыл бұрын
I separated to provide code for topological sort.
@iSumitYadav
@iSumitYadav 4 жыл бұрын
@@techdose4u oh okay...👍🏻
@gontlakowshik2345
@gontlakowshik2345 4 жыл бұрын
Sir, can you explain how find cycle in a graph
@spetsnaz_2
@spetsnaz_2 4 жыл бұрын
Already explained for directed and undirected graph... Check his Graph playlist
@cristianandrei811
@cristianandrei811 3 жыл бұрын
great video
@mohammadshafihamidi1778
@mohammadshafihamidi1778 2 жыл бұрын
if its possible i need some application of topological sort in field of providing accessibility in organic areas
@mayankpatel6735
@mayankpatel6735 3 жыл бұрын
Bhai tabiyat sahi rakho aur videos banate raho, katai aag ho aap
@ekinkale6243
@ekinkale6243 2 жыл бұрын
ı think this is wrong because 2 has 3 indegree inputs (not 2 indegrees). that's why when we delete the 4 and 5 , it has also 0 indegree input. so it should be 4 possible results : " 4 - 5 - 0 - 2 - 3 - 1" or " 4 - 5 - 0 - 3 - 2 - 1" / " 5 - 4 - 0 - 2 - 3 - 1" or " 5 - 4 - 0 - 3 - 2 - 1"
@pradnyabapat9531
@pradnyabapat9531 2 жыл бұрын
Thank you!!
@abhishekkumardwivedi3817
@abhishekkumardwivedi3817 4 жыл бұрын
sir, please try to add a video for egg dropping puzzle if possible
@lokeshpatel3914
@lokeshpatel3914 4 жыл бұрын
what if we get more than one components in graph and 1 component forms DAG and other does not ?
@AjayKumar-un2fz
@AjayKumar-un2fz 4 жыл бұрын
Simply , we can't do topological sort because one of component is not DAG . We will got stuck in cycle while selecting courses for that component.
@lokeshpatel3914
@lokeshpatel3914 4 жыл бұрын
@@AjayKumar-un2fz But in such case an empty array can't be returned as output coz there must be some courses we can take as valid courses which forms different component .
@techdose4u
@techdose4u 4 жыл бұрын
Read this: stackoverflow.com/questions/36712146/if-topological-sort-uses-dfs-how-can-it-succeed-on-disconnected-graphs
@umapathybabu8397
@umapathybabu8397 4 жыл бұрын
After graph series, can you start with greedy
@techdose4u
@techdose4u 4 жыл бұрын
I will try.
K Closest Points to Origin | Leetcode #973
9:18
Techdose
Рет қаралды 23 М.
Course Schedule II - Topological Sort - Leetcode 210
17:09
NeetCode
Рет қаралды 169 М.
«Жат бауыр» телехикаясы І 30 - бөлім | Соңғы бөлім
52:59
Qazaqstan TV / Қазақстан Ұлттық Арнасы
Рет қаралды 340 М.
Война Семей - ВСЕ СЕРИИ, 1 сезон (серии 1-20)
7:40:31
Семейные Сериалы
Рет қаралды 1,6 МЛН
«Жат бауыр» телехикаясы І 26-бөлім
52:18
Qazaqstan TV / Қазақстан Ұлттық Арнасы
Рет қаралды 434 М.
Почему Катар богатый? #shorts
0:45
Послезавтра
Рет қаралды 2 МЛН
This Algorithm is 1,606,240% FASTER
13:31
ThePrimeagen
Рет қаралды 859 М.
G-21. Topological Sort Algorithm | DFS
13:30
take U forward
Рет қаралды 353 М.
Winning Google Kickstart Round A 2020 + Facecam
17:10
William Lin (tmwilliamlin168)
Рет қаралды 10 МЛН
Kosaraju Algorithm | Strongly connected components in a graph
24:30
Topological Sort | Kahn's Algorithm | Graph Theory
13:32
WilliamFiset
Рет қаралды 134 М.
Dynamic Programming isn't too hard. You just don't know what it is.
22:31
DecodingIntuition
Рет қаралды 234 М.
Top 7 Algorithms for Coding Interviews Explained SIMPLY
21:22
Codebagel
Рет қаралды 466 М.
«Жат бауыр» телехикаясы І 30 - бөлім | Соңғы бөлім
52:59
Qazaqstan TV / Қазақстан Ұлттық Арнасы
Рет қаралды 340 М.