Delete a node from a Singly Linked List at a given position (Animation)

Рет қаралды 26,322

3 жыл бұрын

►Full DSA Course - • Data Structures and Al...
►Follow me on Instagram - bit.ly/intrvwkckstrt
►Follow me on LinkedIn - bit.ly/fllwlkdn
►Enroll in the complete course: bit.ly/3W4qthg
►Source Code - github.com/dinesh-varyani/ds-...
►Download DSA Animation Slides - techready.in/courses/150-dsa-...
►Click here to subscribe - kzfaq.info...
Watch all my playlist here:
►Data Structures and Algorithms Course playlist: • Data Structures and Al...
►Mastering JUnit 5 - kzfaq.info?list...
►Mastering Mockito 3 - • Mockito 3 Tutorials
►Analysis of Algorithms - • Analysis of Algorithms
►Linked List Data Structures - • Linked List Data Struc...
►Array Data Structures - • Playlist
►Stack Data Structure - • Stack Data Structure
►Queue Data Structure - • Queue Data Structure
►Binary Tree Data Structure - • Binary Tree Data Struc...
►Graph Data Structure - • Graph Data Structure
►Binary Heap Data Structure - • Binary Heap Data Struc...
►Trie Data Structure - • Trie Data Structure
►Dynamic Programming Algorithms - • Dynamic Programming Al...
►Hashing Data Structures - • Hashing Data Structures
►Sorting and Searching - • Sorting and Searching
►String Algorithms - • String Algorithms
Want to land a software engineering job in the IT industry? This course - 'Visualizing Data Structures and Algorithms' is here to help. The course walks you through multiple Java algorithms, data structures problems, and their solutions with step by step visualizations, so that you are actually learning instead of blindly memorizing solutions.
The course covers in and outs of Data Structures and Algorithms in Java. Java is used as the programming language in the course. Students familiar with Javascript, Python, C#, C++, C, etc will also get to learn concepts without any difficulty. The implementation of various Algorithms and Data Structures have been demonstrated and implemented through animated slides. It covers many interview room questions on Algorithms and Data Structures. The questions and solutions are demonstrated by -
1. Animated slide. (To make visualization of algorithms faster)
2. Coding algorithm on IDE.
The course covers topics such as -
0. Algorithm Analysis
1. Arrays
2. Matrix
3. Singly Linked List
4. Doubly Linked List
5. Circular Singly Linked List
6. Stacks
7. Queues
8. Binary Tree
9. Binary Search Tree
10. Graphs
11. Priority Queues and Heaps
12. Recursion
13. Searching
14. Sorting
15. Strings
16. Trie Data Structure
17. Dynamic Programming
and many more ...
#dsa #algorithms #coding

Пікірлер: 46

@itsdineshvaryani 3 жыл бұрын

Please *Subscribe* and *Click Bell* 🔔🔔🔔 Icon for More Updates. To get *Data Structures and Algorithms* complete course for free please follow this link - kzfaq.info/sun/PL6Zs6LgrJj3tDXv8a_elC6eT_4R5gfX4d

@sahanakattimani9998 2 жыл бұрын

Thank you for such a good course. One thing to be noticed in singly linked list program implementation is when the first node is deleted, head is returned. But returning head node will not actually delete the node from the list. So this case needs to be handled.

@User22_2g Ай бұрын

What do we need to do to delete it ?

@shubhamagarwal1434 2 жыл бұрын

Best series for DS & Algo. I am also 10 yrs java exp guy. Was looking for DS & Algo free course over KZfaq with java implementation and found this. Hats Off To You Man...Excellent Work. GOD BLESS YOU :)

@itsdineshvaryani 2 жыл бұрын

Thanks !!!

@aniketsomkuwar8617 Жыл бұрын

Thank you very much sir. That's all I can say now . Your explanation is very much clear, we don't have to check other video on the topic you taught to us. God bless us😇🙏

@mrunaligaikwad1953 2 жыл бұрын

deleting when position is 1 is same as delete node at the start i feel, can we not apply the temp concept here? Also you did move head to head.next, then assigning temp to the first node and then marking temp to null can work here. does that make sense

@MohdDanish-kv8ry 3 жыл бұрын

salute to your hard work. I mean, How so you not have a million subs.

@itsdineshvaryani 3 жыл бұрын

It will reach there one day. Need ur help, just like and share videos with ur friends and colleagues.

@shreeyabhosale2527 3 жыл бұрын

Thank you for making this series

@itsdineshvaryani 3 жыл бұрын

Welcome !!!

@ahmadabdou2751 2 жыл бұрын

Thanks for your videos they are really helpful, keep up the good work

@itsdineshvaryani 2 жыл бұрын

Thanks !!!

@polash9689 3 жыл бұрын

Sir, Your teaching method is so good.

@itsdineshvaryani 3 жыл бұрын

Thanks !!!

@sreddy8141 3 жыл бұрын

Awesome sir, i have shared this wonderful Playlist wit ma frds, so helpful it is

@itsdineshvaryani 3 жыл бұрын

Thanks a lot !!!

@shubhambhopale4603 2 жыл бұрын

Hello @Dinesh Varyani, I have reached till this video so far and every video is a peace of GEM. Just one suggestion, wouldn't it have been even more value add to this if you would have discussed the TC & SC for the algorithms you are discussing in the videos.

@itsdineshvaryani 2 жыл бұрын

Will try to add once some pending requests and topics are covered ...

@aniketsomkuwar8617 Жыл бұрын

My Guru

@wakeelmalik8387 2 жыл бұрын

if someone pass position greater than LinkedList size, in that case code will through NullPointerException

@devendrasinghrathore78 2 жыл бұрын

its wonderful explanation and course

@itsdineshvaryani 2 жыл бұрын

thanks !!!

@cricketwallaah7702 3 жыл бұрын

Thanks🙏 it's very helpful

@itsdineshvaryani 3 жыл бұрын

Welcome !!!

@chetantayde1055 3 жыл бұрын

Thank you sir very good content best data structure course.

@itsdineshvaryani 3 жыл бұрын

Welcome !!!

@lakshmigopan9956 3 жыл бұрын

Thank you so much sir..

@itsdineshvaryani 3 жыл бұрын

Welcome !!!

@sanjushekhawat6446 3 жыл бұрын

Thanks sir good content keep it

@itsdineshvaryani 3 жыл бұрын

Welcome !!!

@abhishekranjan1094 3 жыл бұрын

very nice sir 🙏

@itsdineshvaryani 3 жыл бұрын

Thanks !!!

@giazz2099 2 жыл бұрын

Sir, got a question. When deleting position / node 3 for example, node 3 is still pointing to the next node, and is referenced by "current", so is it right that it won't be auto garbage collected? And we should add "current.next=null" to make sure its no longer pointing to this list? thank you very much!

@itsdineshvaryani 2 жыл бұрын

after method ends ... current will be garbage collected !!!

@giazz2099 2 жыл бұрын

@@itsdineshvaryani thank you sir!!

@modinglymods4085 Жыл бұрын

why do we always use while loop here. Why not for loop? Is there any performance difference?

@shabiransari4638 11 ай бұрын

bcz you don't know the size initially

@jaspalsingh-mv5xh 3 жыл бұрын

Nice

@itsdineshvaryani 3 жыл бұрын

Thanks

@MANISHYADAV-dd4ug 3 жыл бұрын

If we delete from position 2 then how your pseudo code run???

@Unknown-Stranger 3 жыл бұрын

while condition is becomes false and previous points to head which is behind of position 2 and works accordingly without any error.

@karentechnologies3990 2 жыл бұрын

Sir why in linked list we always start counting the position from 1 not from 0?

@itsdineshvaryani 2 жыл бұрын

we can start from 0 ... it depends how u implement it !!!

@whiteshadow5763 2 жыл бұрын

Thank you very much sir. That's all I can say now . Your explanation is very much clear, we don't have to check other video on the topic you taught to us. God bless us😇🙏

@itsdineshvaryani 2 жыл бұрын

Thanks !!!