No video

Linked List Tutorial - Singly + Doubly + Circular (Theory + Code + Implementation)

  Рет қаралды 734,807

Kunal Kushwaha

Kunal Kushwaha

Күн бұрын

Learn complete Singly + Doubly + Circular #LinkedList in a single video! One of the most important data structures for coding interviews. Here we also build the Linked List from scratch and see how it works internally!
Take part in the learning in public initiative! Share your learnings on LinkedIn and Twitter with #DSAwithKunal & don't forget to tag us!
👉 Resources
- Join Replit: join.replit.com/kunal-kushwaha
- Complete Java DSA playlist: • Java + DSA + Interview...
- Code, Assignments, & Notes: github.com/kunal-kushwaha/DSA...
➡️ Connect with me: www.techwithkunal.com
=========================================
Timestamps:
0:00:00 Introduction
0:02:35 Limitations of Array/ArrayList
0:04:08 Working of LinkedList
--- Singly LinkedList ---
0:06:18 Singly LinkedList
0:16:25 Insertion in Singly LinkedList
0:22:41 Display Singly LinkedList
0:29:28 Insertion in Singly LinkedList [Continuation]
0:40:04 Deletion in Singly LinkedList
0:54:48 Some Common Doubts
--- Doubly LinkedList ---
1:00:46 Doubly LinkedList
1:08:52 Insertion in Doubly LinkedList
1:10:30 Display Doubly LinkedList
1:13:12 Reversal of LinkedList
1:16:07 Insertion in Doubly LinkedList [Continuation]
--- Circular LinkedList ---
1:37:35 Circular LinkedList
1:42:46 Insertion in Circular LinkedList
1:43:49 Display Circular LinkedList
1:47:28 Deletion in Circular LinkedList
1:54:21 Outro
#placement #dsa #interviews

Пікірлер: 668
@KunalKushwaha
@KunalKushwaha 15 күн бұрын
DSA + interview preparation playlist: kzfaq.info/sun/PL9gnSGHSqcnr_DxHsP7AW9ftq0AtAyYqJ
@shafinnahian75
@shafinnahian75 Жыл бұрын
_"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
@I_am_FRANCO
@I_am_FRANCO 6 ай бұрын
1:05:43 piece of medovic
@ShivamKumar-ys2rm
@ShivamKumar-ys2rm 5 ай бұрын
@saarza9991
@saarza9991 4 ай бұрын
​@@ShivamKumar-ys2rm chipi
@umasivasangaran
@umasivasangaran 2 ай бұрын
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💯
@take_a_breath100
@take_a_breath100 Ай бұрын
respect mom
@devangsaini4783
@devangsaini4783 7 ай бұрын
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.
@rajshiromani727
@rajshiromani727 3 ай бұрын
Konsa paid batch h bhai??
@Cloud-577
@Cloud-577 2 жыл бұрын
Kunal despite sounding sick he still provided us with top quality explanation and very engaging (something many courses lack)
@ecode5225
@ecode5225 5 ай бұрын
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.
@Moch117
@Moch117 2 жыл бұрын
Watching this from over in America, I can confidently say there hasn't been a guy on KZfaq i found who is as good as you. You are a beast !! Thank you for all these videos !!
@adworksout7
@adworksout7 2 жыл бұрын
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
@abhijitpatil5506
@abhijitpatil5506 2 жыл бұрын
please upload daily one video
@onkarm49
@onkarm49 Жыл бұрын
true
@courtneyadjoa246
@courtneyadjoa246 10 ай бұрын
@@abhijitpatil5506 🤣😂
@user-ut6eo3be5g
@user-ut6eo3be5g 2 жыл бұрын
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 🔥🔥🔥🔥 .
@thinkingmad1685
@thinkingmad1685 2 жыл бұрын
You watched it whole 😯 in 1 hour 😒
@user-ut6eo3be5g
@user-ut6eo3be5g 2 жыл бұрын
@@thinkingmad1685 I watch lectures at ×2 speed
@user-ut6eo3be5g
@user-ut6eo3be5g 2 жыл бұрын
I was at 1:36:18 while posting the comment
@kushagramudgal398
@kushagramudgal398 2 жыл бұрын
Its a pretty good video but mycodeschool still has the best ds videos on KZfaq
@user-ut6eo3be5g
@user-ut6eo3be5g 2 жыл бұрын
@@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 .
@Helly_Patel
@Helly_Patel 2 жыл бұрын
Thanks for teaching us like no one did till now!! One small request, please make lectures on dynamic programming as well!!
@ayushgoel4660
@ayushgoel4660 2 жыл бұрын
Thanks for being consistent until now. Bang on!
@singh8908
@singh8908 Ай бұрын
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.
@amansrivastava834
@amansrivastava834 2 жыл бұрын
If KZfaq has a museum than this playlist needs to be saved in that for our future generations 💪
@harshjaiswal1634
@harshjaiswal1634 2 жыл бұрын
Bro the distinguished thumbnails you're putting for each topic is so impressive 👏👏
@KunalKushwaha
@KunalKushwaha 2 жыл бұрын
Thank you so much 😀
@prajwalpande3757
@prajwalpande3757 2 жыл бұрын
Yes sir... It's really clarifies everything
@Adarshkumar-uk5is
@Adarshkumar-uk5is 2 жыл бұрын
@@KunalKushwaha Please bro make videos on Trees, Dynamic Programming, Heap & Greedy.
@vaishnaveejagtap954
@vaishnaveejagtap954 2 жыл бұрын
@@KunalKushwaha please do make videos on dynamic programming.
@ayankhanra7910
@ayankhanra7910 2 жыл бұрын
@@Adarshkumar-uk5is I think he quitted🙂
@Anshulpundir-u1s
@Anshulpundir-u1s 23 күн бұрын
"I was struggling to understand DSA, but your playlist has been a game-changer! Now I'm feeling like, 'Is it really this hard?'" 😀
@hakunamatata4880
@hakunamatata4880 Жыл бұрын
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🎉
@shahdadpeykani7641
@shahdadpeykani7641 7 ай бұрын
The amount of knowledge I gained by watching this video was more than one semester at university honestly, thanks a lot!
@KunalKushwaha
@KunalKushwaha 7 ай бұрын
You're very welcome!
@henishapanchal654
@henishapanchal654 Жыл бұрын
Perfect! you saved a lot of time going through books and notes with this simple LinkedList understanding!
@shafaq-here
@shafaq-here 2 жыл бұрын
Amazing way to introduce a data structure by teaching us to create our own, Linked List is now simpler than it was ever before.
@sumanjyoti6063
@sumanjyoti6063 2 ай бұрын
Everyone teaches linked list in this manner only , by creating linked list
@shreyasnaphad3284
@shreyasnaphad3284 2 жыл бұрын
Glad to see the linked list topic completed in a single awesome video
@KunalKushwaha
@KunalKushwaha 2 жыл бұрын
Questions videos to come
@ramakrishna4092
@ramakrishna4092 2 жыл бұрын
@@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
@chaitanbruce9217
@chaitanbruce9217 2 жыл бұрын
@@KunalKushwaha when will this COURSE complete brother?
@parthvaghela3306
@parthvaghela3306 2 жыл бұрын
@@chaitanbruce9217 same que bro
@parthvaghela3306
@parthvaghela3306 2 жыл бұрын
@@KunalKushwaha hey kunal we also want combine notes for revision
@som_girl6702
@som_girl6702 Жыл бұрын
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.
@KunalKushwaha
@KunalKushwaha Жыл бұрын
You're very welcome!
@pratyushkumar1919
@pratyushkumar1919 11 ай бұрын
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.
@aashashanmugam
@aashashanmugam 3 ай бұрын
THE best video on LinkedLists. Can't appreciate enough. Thanks Kunal!
@KunalKushwaha
@KunalKushwaha 3 ай бұрын
You’re welcome
@srchoudharyy
@srchoudharyy 2 жыл бұрын
Feeling Happy for seeing your graph increasing exponentially. Keep it up.
@dharani_dharan.r4680
@dharani_dharan.r4680 2 жыл бұрын
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 ❤.
@sugyaneesahu3585
@sugyaneesahu3585 2 жыл бұрын
Really impressed to see the effort you put in while teaching each and every topic. Extremely helpful.Thanks!
@harshilsingh3880
@harshilsingh3880 2 жыл бұрын
yaa same
@anmolverma075
@anmolverma075 Жыл бұрын
Bhaav bdh gye Kunal bhai k sb comments pdh k , courses he bnd krdiya 😶
@princes5541
@princes5541 Жыл бұрын
@@anmolverma075 lol
@btryx9378
@btryx9378 2 жыл бұрын
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.
@siddiksid3287
@siddiksid3287 Жыл бұрын
This is the best Dsa course i've seen so far.Thanks for making me fall in love with programming
@shurshuf7588
@shurshuf7588 10 ай бұрын
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!
@pratiklohar4566
@pratiklohar4566 3 ай бұрын
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.🖤
@Sunshine-dc4lt
@Sunshine-dc4lt 2 жыл бұрын
Thanks Kunal , keep up the good work. Ignore the hate which they want to spread against you. And always guide us to right path.
@raktimghosal4562
@raktimghosal4562 2 жыл бұрын
Your teaching skill is marvelous. You should try teaching at MIT or Havard.
@KunalKushwaha
@KunalKushwaha 2 жыл бұрын
maybe someday
@thechaoticmonk7339
@thechaoticmonk7339 2 жыл бұрын
Bhaisaab kuch zyada ni ho gya, matlb kuch bhi
@DipakKumar-ey9ix
@DipakKumar-ey9ix 2 жыл бұрын
@@satyabansahoo1862 and moreover , moron's remarks are not taken into consideration , so better luck next time.
@KunalKushwaha
@KunalKushwaha 2 жыл бұрын
@@satyabansahoo1862 funny thing is you a hater and still watching my tutorials lol
@Emoji1970
@Emoji1970 2 жыл бұрын
@@KunalKushwaha yee hui n bat...he is hater but still he is here and learning 😂
@yashtibra3684
@yashtibra3684 2 жыл бұрын
Finally Linked List is here. Was waiting excitedly.Thanks Kunal✨✨
@hey_utkarshh
@hey_utkarshh 2 жыл бұрын
Amazing . Watched the entire playlist till now . btw the community really helps in comments also !
@adityarajagrawal6899
@adityarajagrawal6899 Жыл бұрын
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
@rishabsharma9915
@rishabsharma9915 2 жыл бұрын
New series to binge watch this playlist 🔥 kunal ur just awesome bro thanks very much
@KunalKushwaha
@KunalKushwaha 2 жыл бұрын
Thank you so much 😀
@annusingh4694
@annusingh4694 2 жыл бұрын
You are making history! 💯
@nishantsingh2513
@nishantsingh2513 2 жыл бұрын
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👌🏻👌🏻
@varsha_bhat
@varsha_bhat 2 жыл бұрын
Thank you for these amazing videos! Waiting for videos on binary trees, graphs and Binary heap concepts.
@vishwajeetnandyaduraj4804
@vishwajeetnandyaduraj4804 Жыл бұрын
😢
@abdurrahmansa3763
@abdurrahmansa3763 2 жыл бұрын
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
@RishabhxShukla
@RishabhxShukla 2 жыл бұрын
I waited so long for this.. Thank you!!
@ADITYARAJ-yv2tr
@ADITYARAJ-yv2tr 2 жыл бұрын
Thank You for making such great contents.........in binarysearch i had been trying to solve a question for over 2 month...i had also watched their solution but never understood the approach but after watching your videos i had solved 3 hard level question on my own. Can't express my feeling.....🥺🥺🥺🥺
@KunalKushwaha
@KunalKushwaha 2 жыл бұрын
You got it
@meetjain9178
@meetjain9178 5 ай бұрын
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.
@ferdoushasan6823
@ferdoushasan6823 2 жыл бұрын
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 ❤️
@manvithkumbla
@manvithkumbla 2 жыл бұрын
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 !!
@rahulankana
@rahulankana 2 жыл бұрын
The dedication and passion toward sharing the knowledge you have is just awesome, and love the way you teach❤
@amruthaa5876
@amruthaa5876 2 жыл бұрын
Consistency. Woah. Huge respect ❤️
@SlavaBogatov
@SlavaBogatov 2 жыл бұрын
Hey Kunal, thank you for your videos. I was coding along with you (trying on my own and checking back), was running different tests and found some mistakes. In your version of circular linked list there is an NPA for the display method if our list is of size 1. I realised, it is because you didn't assign head.next = node; tail.next = node; when creating the first Node in the insert method. The delete method of CLL works with list size > 1, and will not delete the only node in the list of size 1. So I added this code: if(size == 1 && head.value == value) { head = null; tail = null; size--; return; } And if there is no need in extra variable such as 'size' (like there is no in the video), we can use if(head.next == head && head.value == value) Thanks again, and don't take this as a critique (maybe a very little), but through this self work I deepen my understanding.
@KunalKushwaha
@KunalKushwaha 2 жыл бұрын
Nice edge cases, thank you!
@gautamgarg5904
@gautamgarg5904 2 жыл бұрын
Not just that if you delete tail node then you need to reassign tail node
@ihsannuruliman3656
@ihsannuruliman3656 2 жыл бұрын
great eye, I also didn't realise it
@mohammadmubeenahmed2119
@mohammadmubeenahmed2119 Жыл бұрын
Was here to comment the same!
@vikaskumarnitrr
@vikaskumarnitrr 2 жыл бұрын
literally watched this video 3 times but i got a better understanding everytime atlast i have understood it thanks bhaiya...
@utkarshsinghal5011
@utkarshsinghal5011 2 жыл бұрын
the thing in which the channel is best at : providing quality content for free
@subhajitghosh5265
@subhajitghosh5265 2 жыл бұрын
Hello Kunal, While deleting in particular index I think we should cover the test case when index>size of list too.
@amanbisht4286
@amanbisht4286 2 жыл бұрын
Kunal Your videos are amazing all the concepts has been taught very well even I don't get bored while I watch your videos
@abhimanyutripathi9
@abhimanyutripathi9 20 күн бұрын
In CLL just add one condition that if(n ==tail){ tail == node; } in that if condition of do while, so that if you are deleting the last element then after that you wanna insert an element, it will be added as expected, if we would not add this above condition and try to insert after deleting last element it will not insert element when you display
@sandeepmukherjee739
@sandeepmukherjee739 2 жыл бұрын
programming is so much fun if you have a great mentor like him
@som_girl6702
@som_girl6702 Жыл бұрын
I totally agree
@harshitkaushal1584
@harshitkaushal1584 11 ай бұрын
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!!!
@koushiksaha3511
@koushiksaha3511 2 жыл бұрын
Thanks Kunal, it's helped me a lot. It's really awesome the way you explain the topic in all of your videos. 👍
@jaiadityachaudhary431
@jaiadityachaudhary431 2 жыл бұрын
Bhaiya bestest course for DSA ...Please upload more video on DSA topics i.e linear data structure ,other cant teach the way you teach
@rohanharichandan1503
@rohanharichandan1503 2 жыл бұрын
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,
@KoushikDasMagnate2005
@KoushikDasMagnate2005 3 ай бұрын
47:51 "How easy is it now?" The confidence is lit .
@avinashpowar1804
@avinashpowar1804 7 ай бұрын
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! 👍😊
@ranuagrawal6077
@ranuagrawal6077 2 жыл бұрын
dude, he was sick here. I would've slept for the entire day instead of making this video
@mathlover7688
@mathlover7688 2 жыл бұрын
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 ❤️❤️❤️❤️
@abhishekudiya8638
@abhishekudiya8638 2 жыл бұрын
Thanks kunal for awesome content. Huge respect.. Keep going 👍🤘❤️
@irtebatI
@irtebatI 9 күн бұрын
Great content. Thanks. Quick note: In the last section "deletion in Circular Linked List", the approach does not cover the scenario when the element to be deleted is the tail element ( additional steps to cover this case: check whether the element is the tail element, then update tail accordingly ).
@tofumakesvideos
@tofumakesvideos 4 ай бұрын
Hello Kunal, Great tutorial ! God bless, I came across your detailed and clear tutorial. I'm a big fan of the pauses you make between sentences, it really helps the information sink into my brain. Best wishes from Canada.
@shubhamagarwal1434
@shubhamagarwal1434 9 ай бұрын
# 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 :)
@Ayushsharma-qc7qx
@Ayushsharma-qc7qx 9 ай бұрын
Bro you feel amazing watching this cause you Are an experienced person not an amateur that is learning first time
@ridoychandradey8337
@ridoychandradey8337 Жыл бұрын
Just a wonderful tutorial what it should be. Thank you Kunal.
@thanushkrishna2041
@thanushkrishna2041 2 жыл бұрын
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!!!
@ramanshrivastava1407
@ramanshrivastava1407 4 ай бұрын
amazing content. no one can replace kunal
@naveenkamath2882
@naveenkamath2882 2 жыл бұрын
Keep making longer videos , its keeps us motivation to learn :)
@ANKITASINGHBCE
@ANKITASINGHBCE 2 жыл бұрын
Thank you for this awesome explanation I was struggling a lot in data structure I am so grateful to you
@KunalKushwaha
@KunalKushwaha 2 жыл бұрын
You're very welcome!
@abhisheksahu3435
@abhisheksahu3435 2 жыл бұрын
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.
@kushalgandhi26
@kushalgandhi26 2 жыл бұрын
No one has provided this kind of primium knowledge about DS algo at free of cost
@KunalKushwaha
@KunalKushwaha 2 жыл бұрын
I know
@md-abid-hussain
@md-abid-hussain Жыл бұрын
I don't think I'm going to forget this concept
@kiranjadhav1993
@kiranjadhav1993 Жыл бұрын
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
@kapilpatel9379
@kapilpatel9379 2 жыл бұрын
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?
@geetankarkarmakar378
@geetankarkarmakar378 Жыл бұрын
conceptual clarity ->100, after watching the video. Hats off !
@ankit_1012
@ankit_1012 2 жыл бұрын
Many people can make you understand this topics. But only few of them can give you feel of such topics.. And kunal is certainly one of them. Desperately waiting for the questions and assignments video 😁😁😁
@KunalKushwaha
@KunalKushwaha 2 жыл бұрын
Next is that one only
@sakshamgarg6974
@sakshamgarg6974 2 жыл бұрын
When will the new videos of DSA playlist will be uploaded? Please upload it as soon as possible. We are dependant on you for our DSA.
@anshikgupta2993
@anshikgupta2993 2 жыл бұрын
Bhaiya please also do a leetcode questions video for linked list like you did for binary search.
@KunalKushwaha
@KunalKushwaha 2 жыл бұрын
That's what is next
@SandipDas-ww4ph
@SandipDas-ww4ph 2 жыл бұрын
Placement season are just knocking and your videos are really helpful
@deepakdadlani9284
@deepakdadlani9284 2 жыл бұрын
I saw the highlight glad you didnt used the collection framework for LL🥳 that is also imp but wanted without that thankyou
@KunalKushwaha
@KunalKushwaha 2 жыл бұрын
I showed a demo of it but we built it from scratch.
@deepakdadlani9284
@deepakdadlani9284 2 жыл бұрын
@@KunalKushwaha you have replied me everytime thankyou 🥳
@shreyaskaranam1551
@shreyaskaranam1551 2 жыл бұрын
Got to know while implementing it. *size -= 1* is missing from the deleteLast() and deleteFirst() functions. On first run will not affect anything. But once you insert and delete many time(s) it will keep it won't actually delete the element.
@bhavyabansal1143
@bhavyabansal1143 2 жыл бұрын
Hi Kunal, Do you have playlist for hashmaps, trees. graphs too?
@user-md7wc1mc2u
@user-md7wc1mc2u 5 ай бұрын
You are the best sir, Thinking in pen and paper wow, If I knew that before, lots of respect, sir......
@dhawalparmar7117
@dhawalparmar7117 2 жыл бұрын
Your teaching methodology is very excellent, Now I can code complete linked list without the need of pen paper 📜✍️
@ritikkhatana5105
@ritikkhatana5105 2 жыл бұрын
Are la re best teacher ka award la re.
@Sunshine-dc4lt
@Sunshine-dc4lt 2 жыл бұрын
Hey Kunal , please tell can a normal BSc Computer Science student can learn from your devops course which you'll be making?
@user-ut6eo3be5g
@user-ut6eo3be5g 2 жыл бұрын
Yes he clearly mentioned 🙄. Read the post clearly
@satishgajavilli7816
@satishgajavilli7816 2 жыл бұрын
Sooperb!! Please complete array and string questions video also
@maheshbabumeruva4968
@maheshbabumeruva4968 6 ай бұрын
Why are you not using linked list class in util package? It's very simple to perform all those operations right? No need to write this much of code, Is there any reason?
@poojasanap3722
@poojasanap3722 5 ай бұрын
Basically to understand the logic behind the util class. Also, sometimes the interviewer asks us to implement LinkedList from scratch.
@sushantapal7408
@sushantapal7408 8 ай бұрын
Good evening bhaiya, note is not available in GitHub repo...plz resend this... And thanks for making dsa easier...
@sameerakhatoon9508
@sameerakhatoon9508 Жыл бұрын
i was wondering what would be the use of Inner class, but now ik linked list implementation is one of the example!!
@nr1157
@nr1157 2 жыл бұрын
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
@Chetann_
@Chetann_ 8 ай бұрын
Hats off to you brother for delivering quality rich content despite being sick!
@Sunshine-dc4lt
@Sunshine-dc4lt 2 жыл бұрын
Hey , Kunal is it possible actually I am from BSc Computer Science , so can I follow your devops course and your ML course which you will be making in future?
@annusingh4694
@annusingh4694 2 жыл бұрын
Yes! Your field of study doesn't matter. It's your skills which counts.
@wokesoul3517
@wokesoul3517 2 жыл бұрын
yes bro if you have the skills you will never go broke
@Neved123
@Neved123 2 жыл бұрын
@@annusingh4694 hey can you tell by what time we can expect dsa course to finish. And when will devops and ml course start?
@annusingh4694
@annusingh4694 2 жыл бұрын
@@Neved123 DSA will be completed by this month. After that Devops bootcamp (starting from next month), followed by Python & then ML.
@Neved123
@Neved123 2 жыл бұрын
@@annusingh4694 ok thank you for replying.
@vishalgowrav
@vishalgowrav 2 жыл бұрын
The best Linked list video u'll ever find!🔥
@KunalKushwaha
@KunalKushwaha 2 жыл бұрын
Thank You
@dipankaryadav5598
@dipankaryadav5598 2 жыл бұрын
Hey kunal can you share your book list from which resources you learnt all this stuff?
@chodagamniteeshsai9757
@chodagamniteeshsai9757 2 жыл бұрын
Super nice stuff man.... kudos
@manimanideep6889
@manimanideep6889 10 ай бұрын
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 ....
@bhushankumarkhade2985
@bhushankumarkhade2985 Жыл бұрын
Draw it... Code it... That's it...💯
No empty
00:35
Mamasoboliha
Рет қаралды 12 МЛН
Jumping off balcony pulls her tooth! 🫣🦷
01:00
Justin Flom
Рет қаралды 33 МЛН
Secret Experiment Toothpaste Pt.4 😱 #shorts
00:35
Mr DegrEE
Рет қаралды 41 МЛН
Comfortable 🤣 #comedy #funny
00:34
Micky Makeover
Рет қаралды 15 МЛН
No empty
00:35
Mamasoboliha
Рет қаралды 12 МЛН