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 ❤️
@@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.
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
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.
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
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.
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
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.
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
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 !!!
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.
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 ❤.
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!
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
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.
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...
# 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 :)
@ 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.
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!)
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.
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.
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); } }
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💫☺️
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.
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!
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?
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.
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 TH-cam. Keep up the good work Kunal.
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.
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🥺🥺
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
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.
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.
Loving your teaching One Hundred Percent 🔥 guys please confirm this doubt. Q-13: Palindrome LinkedList. Is reverseList(rereverseHead) required for the problem statement or is that some approach to keep in mind incase if we need to solve such problems in future. Thankyou!!
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🔥💓💓💓
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
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]
Kunal bhai plz help ,aage ka videos daal do bahut jaruri h aur kahi se sikhunga toh bahut struggle karna parega hume. You just made easy data structure for us ❤️❤️🤗🤗
![[DRIP] ‘Love, Maybe’ PREVIEW](http://i.ytimg.com/vi/U7hwHp95m1k/mqdefault.jpg)
DSA + interview preparation playlist: th-cam.com/play/PL9gnSGHSqcnr_DxHsP7AW9ftq0AtAyYqJ.html
kunal when will you teach Dp and graphs
Thank you so so much! This is the best dsa+java playlist ever!
@@DAVIDOLIVR Yeah I am also waiting for it.🥲
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.
Thanks for sharing!
@@KunalKushwaha Bhai have u stopped this series incomplete? 😶🙁
@@John12685 I think he is
@@santhoshsiva281 He deceived us
@@KunalKushwaha u deceived us
Thank you so much, 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
How it breaks it in Left he passed the head
@@st-ger public ListNode left(ListNode head){
ListNode node = head;
int length =1;
while(node.next!=null){
node = node.next;
length++;
}
node = head;
ListNode firsthalf = head;
for(int i=0;i
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.
@@sayantanmanna1360 can you name the video?
@@moviesflix7082 leetcode sort list explained Nick White
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.
is he on a trip ?
@@zishanchaudhary221 Apparantly not anymore
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 ❤️
So glad!
@@democratcobra NOw it's 2 week+3days
@@gauravgautam5963 its 3 weeks +1 day
@@amankunda2515 Now, It's still counting
@@gauravgautam5963 Civo Hackathon is about to end, We can expect videos in 4-5 days... Hope for the best
Please please post more videos on stacks, queues, trees, graph... I am solely following your videos (I
ok
@@KunalKushwaha bhai please videos upload kr do rha nhi jaa rha ab aage ke liye
@@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.
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.
it's on github
@@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
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.
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
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.
can relate
I agree
lol
Plz reply to my doubt
Any linked list question you will still not able to solve
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....
Please do videos on trees , graphs and also it's advanced concepts
Har jagah aa jaata hai ye bhai 😂😂
ab nhi karane wale kahi aur se kr le 😂😂
Xavier started learning programming just to comment on programming memes😂
@xavier4107 bro pls ask him complete this series quickly...
Bhaiya never dissappoints❤️. Really looking forward for devops bootcamp.
Yesshhshhhh
@praasoon Guptta It will in future.
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.
He copied the code from leetcode solution.
oh c'mon man i wasted my 30-40 minutes to think how the hell will the recurssion will end if the list will be remain the same
its the 2 pointers method , with midprev is the slow pointer and head is the fast pointer
@@technicalspot1848 can you explain me.. what had happened.. I have the same doubt..
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
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
where has he explained this ? I used the old fast and slow pointer approach and literally got a stackoverflow error
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.
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
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 !!!
Thanks Kunal. I literally completed linked list in 2 days. thanks to your incredible explanation.
In the world full of people teaching for money, we have amazing teacher like Kunal
Amazing bro, keep it up
10:12 how much this man care about us, love you bro
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.
Thanks for teaching us like no one did till now!! One small request, please make lectures on dynamic programming as well!!
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 ❤.
The Best Person, who has the heart to give this much information for free. thank you :)
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!
bhai ye hard waala problem ka ans. nhi aarha...code bhej de
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
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.
thanks bro after wasting so much time I came to your comment
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...
# 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 :)
@ 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.
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!)
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.
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.
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);
}
}
wont work for non-primitives.
That's not the correct way of doing that
After watching all questions except the last one ,last rotate question, I have done it by myself without watching solution 😊. Thank you Kunal.
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💫☺️
4 days before i dont know L of linked list now atleast i have some sort of understanding in LL .Thank you kunal sir
Hey Kunal ,could you add timestamps to the video. It is very good but would become easier and save time to navigate to specific topics.
Thanks
Will be added till tomorrow or day after tomorrow !
Bro I'm in love with your teaching, it has helped me a lot !!!! You are the best ! 🤩🤩
Kunal please post more videos. Final year students really don't have much time left for the placements.
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.
HOW DID UR PLACEMENT WENT BRO?
@@cindrasenareddy1929 yeah i also want to know
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!
credits to striver isn't it?
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?
Thank you, I will
@@KunalKushwaha When? Bhaiya we really need them. hope you will upload them fast.
@@KunalKushwaha complete the bootcamp
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.
You're very welcome!
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 TH-cam. Keep up the good work Kunal.
Waiting for next videos Kunal as drive is going on..btw best course on TH-cam I have came across..keep it up man
"Do you guys realize the immense value of the content being provided here for free?"...
Thanks a lot man :)
The way he teaches java is like learning hindi as Indian.
Thank u so much or this. Thanks a lot brother.
Don't worry I am with you ..
Thank you Kunal for this amazing lecture! I haven't followed any ones channel so much!
Heyy bro.. Watching your video makes me very confident in coding..
Also do videos on DSA advanced like DP Tree and graphs also.. It's my request..
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.
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🥺🥺
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
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.
as soon as question 14 came,I knew at that very moment that you literally made this topic easy,i thought of the solution at the sight of the question
You are GOD of coding! Kudos! I havnt been touch with the algos, but once I starting watching videos, I have regained interest in this! Thanks !
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.
now I am feeling good after solving same hard and medium question on leetcode.
Thank you Kunal. your course is mind blowing.
2:38:52 MODIFIED CODE for Q-15: Reverse k-Nodes in LinkedList.
Modification : Check whether there are enough elements (atleast `k`) after each loop.
CODE:
public ListNode reverseKGroup(ListNode head, int k) {
if(k == 1 || head == null){
return head;
}
ListNode prev = null;
ListNode current = head;
int remaininglength = listLength(head);
while(remaininglength >= k){
ListNode last = prev;
ListNode newEnd = current;
ListNode next = current.next;
for(int i = 0; (current!= null) && i < k; i++){
current.next = prev;
prev = current;
current = next;
next = (next != null) ? next.next : next;
}
if(last == null){
head = prev;
} else{
last.next = prev;
}
newEnd.next = current;
prev = newEnd;
remaininglength = remaininglength - k;
}
return head;
}
//finding the length of the List
public int listLength(ListNode head){
if(head == null){
return 0;
}
ListNode temp = head;
int length = 0;
while(temp != null){
length += 1;
temp = temp.next;
}
return length;
}
I can't believe how I am solving leetcode Hard so easily. ( hawwa bana rakha hai kya :) Thanks Kunal❤
😇😇 Best java dsa or any language dsa out there in the market Nothing else just watch this and if u don`t like this and dsa is not for you
Bro Please complete this series waiting for trees and graphs
Who Said You Can Love Only Living Things... Watch Out This Course...You Will Be In Love With This Course !! Love You Kunal Broooo !!
It's been more than 3 weeks.... Please upload new videos to this dsa playlist
Best way of explaining the thought process ever
I just love this bootcamp. Kunal you are awesome
Great Course, I Loved The Explanation. Thanks. Waiting For Binary Tree and Heaps and HashTables and Dynamic Programming
Just wow!!! It's a really commendable video, man. Fantastic explanation and way to think of a problem. Lots of thanks
Found a new best teacher in youtube..
public void bubbleSort() {
bubbleSort(size - 1, 0);
}
1:46:55 that is the function we are calling ......
Loving your teaching One Hundred Percent 🔥 guys please confirm this doubt.
Q-13: Palindrome LinkedList. Is reverseList(rereverseHead) required for the problem statement or is that some approach to keep in mind incase if we need to solve such problems in future. Thankyou!!
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🔥💓💓💓
Amazingg Bhaai!! Reverse a Linked list recursively and Dry running it cleared all the doubts.
Thank you so much kunal, your lectures helped me a lot.
I didn't know Happy Number could be solved like that, I used brute force approach initially, thanks for the adding that question.
Thank you so much!! These videos are pure gold.
Kunal such a crystal clear explanation u r just killing it
bhai majaa aaya. or ye majaa sabko aana chahiye. ye maja kunal sabko dena chahata hai. bhai kunal ghajab kar diya yaar . kya padhaya hai yaar
thanks bro
If we saw these patterns, they are enough to tackle any problem that it will trigger in our mind,👌👌👌👌👌👌👌👌👌👌
Can't thank you enough for this video, i think this is the best video i have seen so far for linked list!!
Re-watched the video today, Kunal you're awesome! Draw, see what is the output, implement, thats it!!
52:40 cycle LL, imagine the scene from winter soldier, cap and falcon.."On your left".😂
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
The explaination is itself a recursion call you have not understood then just dryrun and watch back the explaination and now everything is cleared.
02:20
#include
using namespace std;
#define isMINDBLOWN(mind,blown) (mind ^ blown)
int main(){
bool MIND = false;
bool BLOWN = true;
cout
thank you Kunal you just made me fall in love with linked lists!!!!
These videos are a masterpiece, but when are the new videos coming in this series , waiting eagerly for a very long time
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
Kunal Kushwaha bhai you are doing great job ❤️❤️❤️😘😘
Moral of the series till now ->
Just draw on the paper , understand it and then write the niche thing that is the code
Hey Kunal!! First of all thanks for this amazing course .
plz can you make one lecture on #hashing ???
it will be so helpful thanks
This course is really helpful 👌🏼👌🏼
I feel so confident on linkedlist questions after watching this video, Please post videos on binary trees Binary search Trees and graphs as well
Finally i got the confidence, Thankyou.
Really Awesome video........ Thank you so much for making such videos, with all the pattern of questions, and telling how to approach it
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]
This is only applicable if the value is primitive or string but not in case of objects.. You have to swap each instance variable in your approach.
Amazing video. Truly helped me to understand linked list in depth. Thank you
Kunal bhai plz help ,aage ka videos daal do bahut jaruri h aur kahi se sikhunga toh bahut struggle karna parega hume.
You just made easy data structure for us ❤️❤️🤗🤗
Thori der se aya magar durust aya❤️