_"How difficult was this?"_ is such a affirmative and supportive thing to say while learning data structure. I'll surely be using it to teach my students one day, man. Kudos
Dear Kunal, I once saw your instagram stories and got to know you are kinda upset with Indian students. I know some people do annoy you and really irritate you but still many of us look upto you and rely on you for top notch content for absolutely free. I request you to please continue providing free knowledge and please do not let the negative people stop you. I personally have a paid course too but the content you provide is far ahead of the content in the course. I really look upto you for my knowledge in tech, hence I request you to please do not bring paid courses and keep everything for free. You can increase the frequency of ads in the video and we are fine with that. I know it takes a lot of effort to create this content and then providing it for free is not justified. But still there are lakhs of students who are deprived of the quality education and you are the one proving to be the saviour. Hence I deeply request you to please continue providing free knowledge to us.
Watching this from over in America, I can confidently say there hasn't been a guy on CZcams i found who is as good as you. You are a beast !! Thank you for all these videos !!
Over 3 years in Java, I haven't found anyone who explains the way you do. I wish I had found you while I was newly learning Java. But, better still it's never too late. I am going to stick and learn bigger concepts as far as Java is concerned and programming at large. I will dedicate special time and go through some of your awesome playlists. Thank you, Kunal, for sharing an amazing content.
This is what I've been wanting from a long time Please complete DSA playlist as fast as possible, your videos are really helpful Better than any college teacher that could've taught me
Thanks for this video, this is exactly what I need to get through a certain job test. Edit: im halfway through, this video is a blessing I finally understand everything i haven't before.
I have never seen such type of explanation anywhere where every single line goes in my mind. But, your explanation works like medicine in my programming journey. Lots of love.
Thank you, the most outstanding teacher of our time! What people pay to get, you teach with a passion for free. Your generation will never lack helpers; they'll continue to soar higher and higher. You are a blessing to many.
Too good !! Kunal's thought process in explaining the concepts is really cool. I have seen the same code in other lectures but the insight he gives is excellent !!
Awesome explanation. This is the first video I am seeing from your collection and I'm impressed by your way of explaining concepts. Pls continue posting on other data structures like trees, graphs
I'm not a guy who sit for an hour to watch a video, but this video especially this particular one, I never ever felt any tiredness or boring, it just went smooth. Seriously the lecture was superb! never felt like this! Kudos man🎉
Bro never ever delete these videos from the channel please i am requesting you. How someone can provide this level of content for free🙂🙂. This is insane👌🏻👌🏻
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 ❤.
kunal has done such amazing work, his teaching and guidance is impeccable. It's been two and a half months and I have learnt so many things in depth without sweating over hard topics like this one.
Great teacher! Your display of the nodes written on the board really helped conceptually understand linked lists and your immediate implementation of those concepts in code was exactly what I needed to put "two and two" together. You are very concise, precise, and efficient in your teaching and I greatly GREATLY appreciate your effort in making these educational videos!
most awated topic. Thanksa Kunal for the Linked list tutorial. Also, Apart from all controversies, you are doing great for the community. Love from Bangladesh ❤️
@@kushagramudgal398 Oh I haven't seen . But I found his explanation the most amazing . But I think Code School doesn't provide these many assignments and examples. Also he is trying to cover all the topics including advanced DS .
@@KunalKushwaha is there any live streaming on weekends to hear the comments directly and reply to them ... I am wondering to ask few questions on live streaming kunal
linkedlist was taught in my 2nd sem i was unable to understand it , even after watching a ton of videos on youtube, but after watching this lecture only i solved leetcode questions without even watching your leetcode solving video. thanks a ton,
Dude you are legit cool. And by watching your videos, even when I am stuck somewhere and I start talking to myself, I am using phrases like cool, ok, thats it, simple! Love your work man
Awesome Kunal!! Keep it going, Your content delivery is good and your confidence level is off the chart. I liked how you approached the problem by making it simple before you solve it!!!
I am watching Linked List for the first time and yes I do feel it will take time to fully grasp this concept. But Kunal ,you are awesome!! Half of doubts were cleared in the "common doubts" section. It felt like you really read my mind. You are only three years older than me and I must admit you are a genius!!!
kunal Sir , you are awesome , my confidance level is now like 100% ..its only because of you, and i recommend this playlist to so many freinds. lots of love sir, thank you for you r time efforts
Sure, here's a more casual and conversational version: Hey there! Just checked out your linked list video, and it's awesome! 🚀 Your explanations made it so much easier to grasp, and the examples were spot on. Thanks a bunch for creating such helpful content! Can't wait to binge-watch more of your stuff and level up my coding learning. Keep those videos coming! 👍😊
Hats of to your knowledge ! 🙌The way you break things and make them simple to understand is amazing. You are helping millions for free. Keep up the good work. God bless you with good health, knowledge and prosperity.🖤
Kunal bhai aage ka tree ,hashing ,graph nhi h kya ,h toh upload kar do You are only the teacher from I am able toh understand everything You make me fearless from data structure Love you bhai love you ❤️❤️❤️❤️
1:10:38 the node.prev =null; statement in insertfirst() is not required rigth ? how ever we r inserting at first then ,when ever the new_node is inserting in the DLL the "newnode.prev" is always null so by default prev is null. is that required? plz clarify ....
Hey kunal! Really appreciate your work. I have done my M.Sc in Microbiology in 2019 and I know it is way off from IT sector. But what should I do if I want to get a job in IT? It will be helpful if you reply.
Hi kunal👍I am new to coding just know basic in java and c completed b.tech cse searching for job. which videos should i start ?can i start with devops as yesterday you mentioned you will start devops course or is it mandatory to learn somw courses and come to devops
Linked lists are a fundamental data structure where each node contains a value and a reference to the next node. The video covers the implementation of singly, doubly, and circular linked lists, including insertion, deletion, and traversal operations. It also discusses the time complexity of these operations and the advantages of using linked lists over arrays. Key moments: 00:04 Linked lists are crucial for interviews, along with trees, hash maps, and heaps. Understanding linked lists and trees is vital as they are commonly asked about in interviews and internships. -Importance of linked lists and trees in interviews and internships. They are frequently asked about and understanding them is key to success. -Different types of linked lists and their operations. Singly linked list, doubly linked list, circular linked list, adding, deleting, and implementing linked lists. -Preparing for interview questions related to linked lists. Understanding problem-solving approaches, common patterns, and recursion with linked lists. 08:08 Linked lists consist of nodes connected by pointers, with each node containing a value and a reference to the next node. Accessing elements by index is not direct, requiring traversal. Adding a tail pointer simplifies insertion at the end, improving efficiency. -Structure of linked lists. Nodes are connected by pointers, each node has a value and a reference to the next node. Accessing elements by index requires traversal. -Importance of tail pointer. Adding a tail pointer simplifies insertion at the end of the linked list, improving efficiency compared to traversing to find the last element. -Implementation details. Creating a linked list class with nodes, head, tail pointers, and maintaining size. Constructor initializes the linked list. 16:11 Understanding how to insert elements at the beginning of a linked list involves creating a new node, updating pointers, and visualizing the process. Displaying the linked list requires iterating through the nodes using the head pointer. -Visualizing the insertion process in a linked list by creating a new node and updating pointers. -Explaining the importance of updating the head and tail pointers when adding the first element to the linked list. -Demonstrating how to display the linked list by iterating through nodes using the head pointer. 24:15 Understanding the concept of linked lists is crucial for manipulating data structures efficiently. By properly managing head and tail pointers, elements can be added or removed effectively. -Explanation of managing head and tail pointers in linked lists for efficient data manipulation. -Demonstration of inserting elements at the beginning and end of a linked list. -Coding example showcasing the process of inserting elements at the last index of a linked list. 32:19 The video explains how to insert an element at a specific index in a linked list. It covers scenarios for inserting at the beginning, end, and a particular position efficiently. -Inserting an element at the last index in a linked list is explained with constant time complexity. -Detailed explanation on how to insert an element at a specific index in a linked list, covering scenarios for different index positions. -The process of inserting a new node at a specific index in a linked list is broken down step by step, including updating pointers and handling edge cases. 40:21 To delete the first element in a linked list, set head to head.next, and if head becomes null, set tail to null. Deleting the last element involves pointing the second last node to null and updating the tail pointer. -Deleting the first element in a linked list. Moving head to head.next and updating tail if needed. -Deleting the last element in a linked list. Pointing the second last node to null and updating the tail pointer. -Removing an element at a specific index. Going to the index before the target and updating the next pointer. 48:24 The video explains how to delete a node in a linked list based on its index or value, demonstrating the process step by step. It also touches on the importance of understanding basic concepts like head, tail, and node connections. -The process of deleting a node in a linked list based on its index or value is detailed, showcasing the logic behind each step. -The significance of grasping fundamental concepts like head, tail, and node connections in linked lists is emphasized for a better understanding of the data structure. -The video hints at the importance of practicing linked list problems to build intuition and prepare for interview questions from top tech companies like Google, Facebook, Amazon, and Microsoft. 56:26 Understanding the concept of reference variables in linked lists is crucial. Reference variables point to other variables, affecting how changes are reflected across the data structure. -Explanation of reference variables in linked lists. Reference variables in linked lists point to other variables, influencing the structure's behavior. -Importance of head in linked lists. The head remains constant during traversal, serving as a reference point for movement within the linked list. -Introduction to doubly linked lists. Doubly linked lists allow bidirectional movement, enhancing traversal capabilities compared to singly linked lists. 1:04:29 The video explains the implementation of a doubly linked list in Java, emphasizing the importance of understanding the logic behind the code rather than memorizing it, preparing viewers for interview-level questions. -Preparation for interview-level questions. The video aims to equip viewers with the knowledge required to tackle complex questions typically asked in interviews, focusing on practical implementation. -The importance of understanding the logic behind the code. It stresses the significance of comprehending the underlying principles rather than rote memorization for long-term retention. 1:12:33 Understanding how to print a linked list in reverse is simple by iterating from the last node to the first, updating pointers accordingly. The process involves checking for the last node and printing values in reverse order. -Explaining the process of printing a linked list in reverse by iterating from the last node to the first and updating pointers accordingly. -Discussing the simplicity of linked list operations like inserting last, emphasizing the internal implementation and its relevance in coding interviews. -Highlighting the ease of using built-in linked list functionalities in programming languages like Java, Python, and C++, and the importance of understanding patterns in coding interviews. 1:20:37 The video discusses the process of inserting a node into a linked list, covering scenarios like inserting at the end, after a specific node, and handling edge cases like an empty list. -Handling edge cases like an empty list by checking if the head is null before proceeding with insertion. -Explaining the process of inserting a node after a specific node in a linked list, using a visual example to demonstrate the concept. 1:28:40 The video explains the process of inserting a node in a doubly linked list after a specific value, emphasizing the importance of checking for null pointers to avoid exceptions. -Importance of creating a new node and updating pointers in a doubly linked list insertion process. -Discussion on potential null pointer exceptions and the need for careful checks in the insertion process to prevent errors. 1:36:44 Circular linked lists are structured like a chain where each node points to the next, forming a loop. Inserting values involves updating pointers to maintain the circular structure. Displaying values requires traversing the list until the starting point is reached. -Implementation of circular linked lists involves updating pointers to maintain the circular structure, ensuring each node points to the next in a loop. -Inserting values in a circular linked list requires updating pointers of the new node and adjacent nodes to maintain the loop structure. -Displaying values in a circular linked list involves traversing the list starting from the head until the loop is completed, using a do-while loop. 1:45:36 Deleting a specific value in a circular linked list involves checking and adjusting pointers. Starting from the head, if the value matches, reassign pointers, else traverse and update pointers accordingly. -Traversal and deletion process in a circular linked list. It involves checking values, reassigning pointers, and moving through nodes until the desired value is deleted. -Handling deletion of a specific value in a circular linked list. Explaining the logic behind adjusting pointers and skipping nodes to effectively delete the desired value from the list. 1:52:51 The video discusses implementing linked lists, emphasizing the importance of understanding internal workings and thought processes, leading to solving various types of questions, including recursion and advanced interview questions. -Importance of understanding internal workings and thought processes in implementing linked lists for problem-solving. -Division of upcoming questions into level one and advanced interview questions, focusing on patterns, theories, and recursion in linked list problem-solving. -Preparation for clearing interviews with big tech companies by mastering linked list problem-solving techniques, including recursion and advanced concepts.
Thank you, Kunal. I am a mother of two kids, wanted to continue my studies in Programming Language, I found your free Lessons🙏 God bless you💯
respect mom
_"How difficult was this?"_ is such a affirmative and supportive thing to say while learning data structure. I'll surely be using it to teach my students one day, man. Kudos
1:05:43 piece of medovic
@@ShivamKumar-ys2rm chipi
Kunal despite sounding sick he still provided us with top quality explanation and very engaging (something many courses lack)
Dear Kunal, I once saw your instagram stories and got to know you are kinda upset with Indian students. I know some people do annoy you and really irritate you but still many of us look upto you and rely on you for top notch content for absolutely free. I request you to please continue providing free knowledge and please do not let the negative people stop you. I personally have a paid course too but the content you provide is far ahead of the content in the course. I really look upto you for my knowledge in tech, hence I request you to please do not bring paid courses and keep everything for free. You can increase the frequency of ads in the video and we are fine with that. I know it takes a lot of effort to create this content and then providing it for free is not justified. But still there are lakhs of students who are deprived of the quality education and you are the one proving to be the saviour. Hence I deeply request you to please continue providing free knowledge to us.
Konsa paid batch h bhai??
Watching this from over in America, I can confidently say there hasn't been a guy on CZcams i found who is as good as you. You are a beast !! Thank you for all these videos !!
Over 3 years in Java, I haven't found anyone who explains the way you do. I wish I had found you while I was newly learning Java. But, better still it's never too late. I am going to stick and learn bigger concepts as far as Java is concerned and programming at large.
I will dedicate special time and go through some of your awesome playlists.
Thank you, Kunal, for sharing an amazing content.
If CZcams has a museum than this playlist needs to be saved in that for our future generations 💪
Thanks for teaching us like no one did till now!! One small request, please make lectures on dynamic programming as well!!
Thanks for being consistent until now. Bang on!
Perfect! you saved a lot of time going through books and notes with this simple LinkedList understanding!
This is what I've been wanting from a long time
Please complete DSA playlist as fast as possible, your videos are really helpful
Better than any college teacher that could've taught me
please upload daily one video
true
@@abhijitpatil5506 🤣😂
Thanks for this video, this is exactly what I need to get through a certain job test.
Edit: im halfway through, this video is a blessing I finally understand everything i haven't before.
I have never seen such type of explanation anywhere where every single line goes in my mind. But, your explanation works like medicine in my programming journey. Lots of love.
Thank you, the most outstanding teacher of our time! What people pay to get, you teach with a passion for free. Your generation will never lack helpers; they'll continue to soar higher and higher. You are a blessing to many.
You're very welcome!
Too good !! Kunal's thought process in explaining the concepts is really cool. I have seen the same code in other lectures but the insight he gives is excellent !!
This is the best Dsa course i've seen so far.Thanks for making me fall in love with programming
Awesome explanation. This is the first video I am seeing from your collection and I'm impressed by your way of explaining concepts. Pls continue posting on other data structures like trees, graphs
I'm not a guy who sit for an hour to watch a video, but this video especially this particular one, I never ever felt any tiredness or boring, it just went smooth. Seriously the lecture was superb! never felt like this! Kudos man🎉
Bro never ever delete these videos from the channel please i am requesting you.
How someone can provide this level of content for free🙂🙂.
This is insane👌🏻👌🏻
the thing in which the channel is best at : providing quality content for free
Feeling Happy for seeing your graph increasing exponentially.
Keep it up.
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 ❤.
Amazing way to introduce a data structure by teaching us to create our own, Linked List is now simpler than it was ever before.
Everyone teaches linked list in this manner only , by creating linked list
The dedication and passion toward sharing the knowledge you have is just awesome, and love the way you teach❤
The amount of knowledge I gained by watching this video was more than one semester at university honestly, thanks a lot!
You're very welcome!
kunal has done such amazing work, his teaching and guidance is impeccable. It's been two and a half months and I have learnt so many things in depth without sweating over hard topics like this one.
Bro the distinguished thumbnails you're putting for each topic is so impressive 👏👏
Thank you so much 😀
Yes sir... It's really clarifies everything
@@KunalKushwaha Please bro make videos on Trees, Dynamic Programming, Heap & Greedy.
@@KunalKushwaha please do make videos on dynamic programming.
@@Adarshkumar-uk5is I think he quitted🙂
Great teacher! Your display of the nodes written on the board really helped conceptually understand linked lists and your immediate implementation of those concepts in code was exactly what I needed to put "two and two" together. You are very concise, precise, and efficient in your teaching and I greatly GREATLY appreciate your effort in making these educational videos!
Consistency. Woah. Huge respect ❤️
You are making history! 💯
most awated topic.
Thanksa Kunal for the Linked list tutorial.
Also, Apart from all controversies, you are doing great for the community.
Love from Bangladesh ❤️
No doubt kunal this is the best video on linked list and off course the whole boot camp stands at the top position . Your explanation is just 🔥🔥🔥🔥 .
You watched it whole 😯 in 1 hour 😒
@@thinkingmad1685 I watch lectures at ×2 speed
I was at 1:36:18 while posting the comment
Its a pretty good video but mycodeschool still has the best ds videos on CZcams
@@kushagramudgal398 Oh I haven't seen . But I found his explanation the most amazing . But I think Code School doesn't provide these many assignments and examples. Also he is trying to cover all the topics including advanced DS .
Glad to see the linked list topic completed in a single awesome video
Questions videos to come
@@KunalKushwaha is there any live streaming on weekends to hear the comments directly and reply to them ... I am wondering to ask few questions on live streaming kunal
@@KunalKushwaha when will this COURSE complete brother?
@@chaitanbruce9217 same que bro
@@KunalKushwaha hey kunal we also want combine notes for revision
I waited so long for this.. Thank you!!
Finally Linked List is here. Was waiting excitedly.Thanks Kunal✨✨
linkedlist was taught in my 2nd sem i was unable to understand it , even after watching a ton of videos on youtube, but after watching this lecture only i solved leetcode questions without even watching your leetcode solving video.
thanks a ton,
Dude you are legit cool. And by watching your videos, even when I am stuck somewhere and I start talking to myself, I am using phrases like cool, ok, thats it, simple! Love your work man
Awesome Kunal!! Keep it going, Your content delivery is good and your confidence level is off the chart. I liked how you approached the problem by making it simple before you solve it!!!
I am watching Linked List for the first time and yes I do feel it will take time to fully grasp this concept. But Kunal ,you are awesome!! Half of doubts were cleared in the "common doubts" section. It felt like you really read my mind. You are only three years older than me and I must admit you are a genius!!!
Really impressed to see the effort you put in while teaching each and every topic. Extremely helpful.Thanks!
yaa same
Bhaav bdh gye Kunal bhai k sb comments pdh k , courses he bnd krdiya 😶
@@anmolverma075 lol
Thanks Kunal , keep up the good work. Ignore the hate which they want to spread against you. And always guide us to right path.
Amazing . Watched the entire playlist till now .
btw the community really helps in comments also !
THE best video on LinkedLists. Can't appreciate enough. Thanks Kunal!
You’re welcome
Keep making longer videos , its keeps us motivation to learn :)
For insert at index in doubly linked list shall we use the size of the list and see if forward or backward will be efficient?
literally watched this video 3 times but i got a better understanding everytime atlast i have understood it thanks bhaiya...
Just a wonderful tutorial what it should be. Thank you Kunal.
Thanks Kunal, it's helped me a lot. It's really awesome the way you explain the topic in all of your videos. 👍
47:51 "How easy is it now?" The confidence is lit .
I don't think I'm going to forget this concept
Thanks kunal for awesome content. Huge respect.. Keep going 👍🤘❤️
kunal Sir , you are awesome , my confidance level is now like 100% ..its only because of you, and i recommend this playlist to so many freinds. lots of love sir, thank you for you r time efforts
Kunal Your videos are amazing all the concepts has been taught very well even I don't get bored while I watch your videos
Sure, here's a more casual and conversational version:
Hey there! Just checked out your linked list video, and it's awesome! 🚀 Your explanations made it so much easier to grasp, and the examples were spot on. Thanks a bunch for creating such helpful content! Can't wait to binge-watch more of your stuff and level up my coding learning. Keep those videos coming! 👍😊
Hats of to your knowledge ! 🙌The way you break things and make them simple to understand is amazing. You are helping millions for free. Keep up the good work. God bless you with good health, knowledge and prosperity.🖤
Hello Kunal, While deleting in particular index I think we should cover the test case when index>size of list too.
conceptual clarity ->100, after watching the video. Hats off !
His commitment and knowledge is amazing.
programming is so much fun if you have a great mentor like him
I totally agree
Your teaching methodology is very excellent, Now I can code complete linked list without the need of pen paper 📜✍️
Thank u very much kunal!! U are awesome👏👏👏
Thanks Kunal for this long video. Cleared many doubts!!
Thank you for these amazing videos! Waiting for videos on binary trees, graphs and Binary heap concepts.
😢
Hi Kunal, Do you have playlist for hashmaps, trees. graphs too?
Thankyou soo much for his internal implementation this is exactly what i was looking for
your logic is outstanding, the idea of the temp node is smart
Your teaching skill is marvelous. You should try teaching at MIT or Havard.
maybe someday
Bhaisaab kuch zyada ni ho gya, matlb kuch bhi
@@satyabansahoo1862 and moreover , moron's remarks are not taken into consideration , so better luck next time.
@@satyabansahoo1862 funny thing is you a hater and still watching my tutorials lol
@@KunalKushwaha yee hui n bat...he is hater but still he is here and learning 😂
u cannot find this type of satisfactory explanation anywhere else😊😊
thanks bro❤
Are la re best teacher ka award la re.
Waited for this since a long time 🔥
Kunal bhai aage ka tree ,hashing ,graph nhi h kya ,h toh upload kar do
You are only the teacher from I am able toh understand everything
You make me fearless from data structure
Love you bhai love you ❤️❤️❤️❤️
Bhaiya bestest course for DSA ...Please upload more video on DSA topics i.e linear data structure ,other cant teach the way you teach
amazing content. no one can replace kunal
Super nice stuff man.... kudos
Placement season are just knocking and your videos are really helpful
Thank you Kunal! Looking forward for future videos.
New series to binge watch this playlist 🔥 kunal ur just awesome bro thanks very much
Thank you so much 😀
Main part of the DSA has been started !!
Plz keep going and continue the whole course as you promised
1:10:38 the node.prev =null; statement in insertfirst() is not required rigth ? how ever we r inserting at first then ,when ever the new_node is inserting in the DLL the "newnode.prev" is always null so by default prev is null. is that required? plz clarify ....
Hey kunal! Really appreciate your work. I have done my M.Sc in Microbiology in 2019 and I know it is way off from IT sector. But what should I do if I want to get a job in IT?
It will be helpful if you reply.
Thank you sir , i was waiting for this...
Thank you for everything! Amazing videos!
Hi kunal, In deleteFirst() we are just moving head to next element but the pervious head will still be in memory somewhere what about that?
Hi kunal👍I am new to coding just know basic in java and c completed b.tech cse searching for job. which videos should i start ?can i start with devops as yesterday you mentioned you will start devops course or is it mandatory to learn somw courses and come to devops
Hats off to you brother for delivering quality rich content despite being sick!
Amazing explanation! Thank you this is very helpful!
thankyou for the video! it really help me so much as a beginner
You nailed it brother ❤️❤️
Thank you for these amazing videos!
sirrrrrrrrrrrr respect from the soul much needed vdo
You are the best sir, Thinking in pen and paper wow, If I knew that before, lots of respect, sir......
Thank you for teaching us.
Sooperb!! Please complete array and string questions video also
Linked lists are a fundamental data structure where each node contains a value and a reference to the next node. The video covers the implementation of singly, doubly, and circular linked lists, including insertion, deletion, and traversal operations. It also discusses the time complexity of these operations and the advantages of using linked lists over arrays.
Key moments:
00:04 Linked lists are crucial for interviews, along with trees, hash maps, and heaps. Understanding linked lists and trees is vital as they are commonly asked about in interviews and internships.
-Importance of linked lists and trees in interviews and internships. They are frequently asked about and understanding them is key to success.
-Different types of linked lists and their operations. Singly linked list, doubly linked list, circular linked list, adding, deleting, and implementing linked lists.
-Preparing for interview questions related to linked lists. Understanding problem-solving approaches, common patterns, and recursion with linked lists.
08:08 Linked lists consist of nodes connected by pointers, with each node containing a value and a reference to the next node. Accessing elements by index is not direct, requiring traversal. Adding a tail pointer simplifies insertion at the end, improving efficiency.
-Structure of linked lists. Nodes are connected by pointers, each node has a value and a reference to the next node. Accessing elements by index requires traversal.
-Importance of tail pointer. Adding a tail pointer simplifies insertion at the end of the linked list, improving efficiency compared to traversing to find the last element.
-Implementation details. Creating a linked list class with nodes, head, tail pointers, and maintaining size. Constructor initializes the linked list.
16:11 Understanding how to insert elements at the beginning of a linked list involves creating a new node, updating pointers, and visualizing the process. Displaying the linked list requires iterating through the nodes using the head pointer.
-Visualizing the insertion process in a linked list by creating a new node and updating pointers.
-Explaining the importance of updating the head and tail pointers when adding the first element to the linked list.
-Demonstrating how to display the linked list by iterating through nodes using the head pointer.
24:15 Understanding the concept of linked lists is crucial for manipulating data structures efficiently. By properly managing head and tail pointers, elements can be added or removed effectively.
-Explanation of managing head and tail pointers in linked lists for efficient data manipulation.
-Demonstration of inserting elements at the beginning and end of a linked list.
-Coding example showcasing the process of inserting elements at the last index of a linked list.
32:19 The video explains how to insert an element at a specific index in a linked list. It covers scenarios for inserting at the beginning, end, and a particular position efficiently.
-Inserting an element at the last index in a linked list is explained with constant time complexity.
-Detailed explanation on how to insert an element at a specific index in a linked list, covering scenarios for different index positions.
-The process of inserting a new node at a specific index in a linked list is broken down step by step, including updating pointers and handling edge cases.
40:21 To delete the first element in a linked list, set head to head.next, and if head becomes null, set tail to null. Deleting the last element involves pointing the second last node to null and updating the tail pointer.
-Deleting the first element in a linked list. Moving head to head.next and updating tail if needed.
-Deleting the last element in a linked list. Pointing the second last node to null and updating the tail pointer.
-Removing an element at a specific index. Going to the index before the target and updating the next pointer.
48:24 The video explains how to delete a node in a linked list based on its index or value, demonstrating the process step by step. It also touches on the importance of understanding basic concepts like head, tail, and node connections.
-The process of deleting a node in a linked list based on its index or value is detailed, showcasing the logic behind each step.
-The significance of grasping fundamental concepts like head, tail, and node connections in linked lists is emphasized for a better understanding of the data structure.
-The video hints at the importance of practicing linked list problems to build intuition and prepare for interview questions from top tech companies like Google, Facebook, Amazon, and Microsoft.
56:26 Understanding the concept of reference variables in linked lists is crucial. Reference variables point to other variables, affecting how changes are reflected across the data structure.
-Explanation of reference variables in linked lists. Reference variables in linked lists point to other variables, influencing the structure's behavior.
-Importance of head in linked lists. The head remains constant during traversal, serving as a reference point for movement within the linked list.
-Introduction to doubly linked lists. Doubly linked lists allow bidirectional movement, enhancing traversal capabilities compared to singly linked lists.
1:04:29 The video explains the implementation of a doubly linked list in Java, emphasizing the importance of understanding the logic behind the code rather than memorizing it, preparing viewers for interview-level questions.
-Preparation for interview-level questions. The video aims to equip viewers with the knowledge required to tackle complex questions typically asked in interviews, focusing on practical implementation.
-The importance of understanding the logic behind the code. It stresses the significance of comprehending the underlying principles rather than rote memorization for long-term retention.
1:12:33 Understanding how to print a linked list in reverse is simple by iterating from the last node to the first, updating pointers accordingly. The process involves checking for the last node and printing values in reverse order.
-Explaining the process of printing a linked list in reverse by iterating from the last node to the first and updating pointers accordingly.
-Discussing the simplicity of linked list operations like inserting last, emphasizing the internal implementation and its relevance in coding interviews.
-Highlighting the ease of using built-in linked list functionalities in programming languages like Java, Python, and C++, and the importance of understanding patterns in coding interviews.
1:20:37 The video discusses the process of inserting a node into a linked list, covering scenarios like inserting at the end, after a specific node, and handling edge cases like an empty list.
-Handling edge cases like an empty list by checking if the head is null before proceeding with insertion.
-Explaining the process of inserting a node after a specific node in a linked list, using a visual example to demonstrate the concept.
1:28:40 The video explains the process of inserting a node in a doubly linked list after a specific value, emphasizing the importance of checking for null pointers to avoid exceptions.
-Importance of creating a new node and updating pointers in a doubly linked list insertion process.
-Discussion on potential null pointer exceptions and the need for careful checks in the insertion process to prevent errors.
1:36:44 Circular linked lists are structured like a chain where each node points to the next, forming a loop. Inserting values involves updating pointers to maintain the circular structure. Displaying values requires traversing the list until the starting point is reached.
-Implementation of circular linked lists involves updating pointers to maintain the circular structure, ensuring each node points to the next in a loop.
-Inserting values in a circular linked list requires updating pointers of the new node and adjacent nodes to maintain the loop structure.
-Displaying values in a circular linked list involves traversing the list starting from the head until the loop is completed, using a do-while loop.
1:45:36 Deleting a specific value in a circular linked list involves checking and adjusting pointers. Starting from the head, if the value matches, reassign pointers, else traverse and update pointers accordingly.
-Traversal and deletion process in a circular linked list. It involves checking values, reassigning pointers, and moving through nodes until the desired value is deleted.
-Handling deletion of a specific value in a circular linked list. Explaining the logic behind adjusting pointers and skipping nodes to effectively delete the desired value from the list.
1:52:51 The video discusses implementing linked lists, emphasizing the importance of understanding internal workings and thought processes, leading to solving various types of questions, including recursion and advanced interview questions.
-Importance of understanding internal workings and thought processes in implementing linked lists for problem-solving.
-Division of upcoming questions into level one and advanced interview questions, focusing on patterns, theories, and recursion in linked list problem-solving.
-Preparation for clearing interviews with big tech companies by mastering linked list problem-solving techniques, including recursion and advanced concepts.
I just finished the single linked list part. While deleting the elements, we have to reduce the size too right?
Thanks a lot for this tutorial. Super helpful!
awesome teaching bro....very simple and easily understandable
Hey kunal can you share your book list from which resources you learnt all this stuff?
Best DSA Course.