I am a Dev with 1 year of experience and working with Java technologies like Spring boot, Kafka. But diving into your course and everything seems refreshed and getting new insights too.🔥 Keep up the good work Kunal.
1:32:07 Kunal wrote a new getMid method which returns the mid and also breaks the LL after mid. This breaking of LL is very imp for merge sort to work. So dont use the old middleNode method
Anyone facing difficulty understanding the getMid method (used in sort Linked List) , refer to Nick White's video. It's very intuitive and easy to understand.
Once you come back from your trip it would be highly appreciable if you kindly try to complete the DSA bootcamp ! many of us have interviews and coding round within next few months. Thanks for the good work you do for the community.
Amazingly wow....like literally I was just searching for linked list interview questions on Google and got your video notification.... And I was like yess this is what I want. Thankyou bro you are a savior ❤️
1:32:07 Kunal wrote a new getMid method which returns the mid and also breaks the LL after mid. This breaking of LL is very imp for merge sort to work. So dont use the old middleNode method
Thanks for addressing this issue. I tried to dry-run it using the previous getMid method and wondered how the hell it got accepted on leetcode 🙄 Kunal should have mentioned it in a pinned comment at least.
@@KunalKushwaha Thanks, would be awesome if you ever got back to it. Whenever it is possible for you to do so. I have learned so much about recursion watching your playlist than I ever did reading countless books and watching ton of videos on the subject.
Start of Video: I am afraid of linked list interview Questions. End of Video: Give me any linked list interview Questions, i will solve it within minutes.
I'm following this course desperately as the quality of your teaching & problem solving skill is up to a great extent. Its the only humble request from my side that plz attach all the leetcode problems separately in the description, so that we can practice it there before going to your solution.
@@KunalKushwaha what's wrong with the function(for reversing from newEnd to newStart)? //(used in reverseKNode) (used in reverseKGroup) public ListNode reverseK(ListNode newEnd,ListNode newStart){ ListNode prev=null; while(newEnd!=newStart.next){ //Here its saying to add newEnd!=null, cant it compare with newStart.next ListNode temp=newEnd.next; newEnd.next=prev; prev=newEnd; newEnd=temp; } return prev; } This is my reverseKGroupFunction public ListNode reverseKGroup(ListNode head, int k) { if(k0){ for(int i=1;i
1:33:39 Note here the implementation of fetching mid node is slightly changed, along with getting the mid node, it also cuts off the link between mid node and node previous to node. effectively halving the Original list Node into two parts.
Was searching for a content like this for past 3 years atlast youtube algorithm showed it to me. Now I can clear my dream company Thanks a lot brother....
1:35:00 If you're having a problem here, Kunal changed his mid function a little, I don't know why he didn't mentioned about it. But you can check the code and understand it yourself.
yeah. me too wasted time on that thinking why he is again doing ListNode left= SortList(head). It will be stacj overflow. You made me realise that getMiddle(head) was modified
You are right Kunal.. I was just following SDE sheet , was able to solve the question some how but i was not getting the thought process ! I was wondering how people are finding the intuition and why i am not able to do so. The reason was thought process was missing , You are not teaching how to solve , rather You taught how to think ..... and that's the intuition . Thanks a Lot man, Thought process is important , if one's get's this he can crack any problem of SDE sheet.
The best series! However, I wish you would never stop posting videos for this series as Amazon and others ask questions on other topics, including Binary Trees and HashMaps.
its awsome when i start with this video i didn't even solve a single question on linkedlist, but at the end i solve the medium level problem with myself ,thanks kunal to doing such a gread work !!!
This is first time I am learning DSA, but your way of explanation is just so awesome and clear which I can not express in words u really made DSA piece of cake, Please upload Graph and DP videos also that will make this series complete. Thanks KK for your great work
# GOD Of DSA Hi I am a 11yr exp java guy was searching for some free course on youtube for DSA came accross your course and i just feel love in it...all in one place that too with java...i must say you have done very awsome work...your name will be there on this earth as long as DSA will be asked in interviews...May God Vishnu Bless You :)
Would like to add that in the linked list cycle II problem you don't necessarily need to calculate the cycle length, if you start with both slow and fast pointers at head, the two pointers will meet after traversing the length of the cycle [you can try it out with test cases]. So once the two pointers meet just reset one of them to the head and start traversing till they meet again and the node where they meet will be the answer!
Thankyou very much for this wonderful bootcamp ! Especially your linkedList and stack queue videos extremely helped me to get placed in zoho as a developer . Most needed content and beautiful explanations kunal brother ❤.
In the bubble sort linked list instead of all the checks with tail and head, we can also do normal swap of values. public void bubbleSort(){ bubbleSortRecursive(size-1,0); } private void bubbleSortRecursive(int r,int c){ if(r==0) return; if(c current.value){ int temp = current.value; current.value = prev.value; prev.value = temp; } bubbleSort(r,c+1); } else { bubbleSort(r-1,0); } }
THE BEST TEACHING VIDEO on LinkedList No overcomplications, draw diagram and doing the stuff what uh see. Thats how @kunal make things easy for everyone. Great work.
This video made my fear of Linked List questions go away. You explained very properly so my intuition building has drastically improved. Waiting for you to make topics like Graphs and Dynamic Programming easy for students like us too!
Kunal Bro It's Too Much Helping and For Improving Brainstorming skills for problem solving at next level Untill now,I never met anyone who can teach like you in terms of explanation and thought process, understanding You Doing Great Bro,Thanks A Lot💫☺️
Amazing. Every tips and tricks are helpful. You wre solving those problems like a charm and when you draw tge problem in whiteboard and explain it then its pretty much understandable. Thanks a lot. Love your work.
@ Kunal Kushwaha please upload more DSA videos. I don't want to see other videos for the remaining concepts yours are much clear I leave without doubts after watching your lectures , if this motivates you to upload.
Please post more videos on the remaining topics. Your videos are really great and helpful. I know you will be busy with other things. Can you post the assignments at least for now?
this was a blast Kunal...loved this video and it made me look this type of questions very easy...As Kunal says,"There is no easy, medium and hard questions." Your thought process is helping us beginners very much. Thanks man and keep up the good work...
HIGHLY RECOMMENDED 👌👌 The best linkedlist course ever , i wished i have done earlier and not wasted time from learning by other courses and videos on yt . Thanks kunal for doing such a good job.
I had a lot of problems solving the questions while blindly trying and searching methods and solution.. But this video changed this.. It took 3-4 questions understanding the concept and patterns but after that I solved most of the problems before watching even the theory part of question. A lot of change I can see in my Efficiency. Thanks
Seriously, the best video on LinkedList ever. The explanation and the thought process involved in solving a problem like "HappyNumber" using LinkedList intuition is explained by "KUNAL" is exceptionally so good and very very easy to understand-the best Interview preparation course on RU-vid. Keep up the good work Kunal.
Thanks Kunal, You made Linked List concepts a cakewalk for us ! I feel so confident in the topic now , I used to think this all pointing of nodes is so confusing untill I started following the approach of yours
I'm not able to find your videos on Graphs and Trees, I've cleared 1st round of Google Coding interview (Thanks to YOU 🎉), next I've been asked to be prepared on Graphs and Trees. Can you please paste the links of those videos or anyone having any other good videos around it (But I'd like your videos cuz they are way too good. simple and easy explanation!)
Thank you....Now i am confident and i feel that with a proper teacher like u.....a normal college student can crack coding interviews of big companies.....thank u so much kunal🥺🥺
Hi Kunal....I am watched few of your videos.. Your teaching method is amazing and i am able to visualize the things in my mind which helps to simplify the problem statement.... I am having difficulty in understanding the concepts of Trees...Would love if you can do similar video on Trees.
Kunal Bhai I am also from MAIT, I want to learn concepts like graph,hashmaps form you but i think it will be too late and my placement will come , please try to upload more frequently on this playlist.
Btw , I think for bubble sort for swapping nodes , you can just swap the value of the nodes instead of swapping the node itself. Like [first.value,second.value] = [second.value,first.value]
Some People now want kunal to jump to devops inmediately....This is not the way people. Earlier you only requested for this ...Kunal bhaiya, Please cover all the things like graph dp , stack ..make it a full interviee prep and i know you will🔥💓💓💓
I am so glad that you made this video but I have doubt in distinguishing between subarray questions.I am not able to see when to use sliding window,stack,dp or montonic queue . please make video to solve this subarray questions as it is asked heavily in coding interviews.I am able to solve with tags but the distinguishing part is hard for me
Kunalll that was a grt job man!!literally u explained us how to think and approach the problem keeping in mind how the other person wud approach , eventho u were a pro in it..grt dude
Last ques: Rotate List can also be solved using reverse logic :--> Logic is simple => 1>assign three node prev, curr, after 2>iterate place the curr node at last 3>point it to head of the list and then make it as new head 4>perform it k no of times if(head == null || head.next == null) { return head; } int size = getSize(head); k = k%size; for(int i=0; i
Bhaiya have u thaught maps and hash maps, tree ete. Kunal bhaiya... please continue this series nd make it 100% complete... we don't want to refer anywhere else for other topics.
God damn explanation of each and every intuition I loved it Kunal. Even though it is taking time to understand, once it gets to head nothing can stop to solve similar problems with this intuition. Thank you so much for the entire play list.
Just here to appreciate the detailed explanation of every question which made it super easy to understand but having sorta hard time with the reorder list question
This video has 407k views and only 7k likes , why people don't support his videos even when he had made such a long video to explain every single thing in detailed and easier manner.
After like 2-3 months I've got this question in one of my interview, so I was able to recall the lectures learnings though I came to see the videos again for better. I am looking at 179k views and I am sure next time I would see this video it will 2M views and more to go.
Thank you Bhaiya for the bootcamp.Just to ask that since length of the head to the node where cycle is formed is equal to the length of the node due to which cycle is formed to the length of the node where is cycle is formed is equal i.e in the example length of 1...4 and 6...4 =k so we can run a loop from head till the point where our temp is equal to fast or slow while incrementing both of them.This will reduce the runtime to a greater extent.
