Linked list is a data structure similar to array in a sense that it stores bunch of items. But unlike array, linked lists are not stored in contiguous memory locations. They are instead chained by an element storing address location of next element. This makes insertion very easy. Also unlike dynamic arrays you don't have to pre-allocate some memory capacity. In this tutorial we will go through some theory first and then write python code to implement linked list. In the end we have an interesting exercise for you to solve. Code: https://github.com/codebasics/data-structures-algorithms-python/tree/master/data_structures/3_LinkedList/3_linked_list.py Exercise Link: https://github.com/codebasics/data-structures-algorithms-python/tree/master/data_structures/3_LinkedList/3_linked_list_exercise.md Topics 00:00 Introduction 00:18 Issues with arrays that linked list solves 05:54 Doubly linked list 06:37 Big O analysis (array vs linked list) 08:02 Python implementation 26:00 Exercise #linkedlist #pythonlinkedlist #datastructures #algorithms #python Next Video: https://www.youtube.com/watch?v=ea8BRGxGmlA&list=PLeo1K3hjS3uu_n_a__MI_KktGTLYopZ12&index=5 Previous video: https://www.youtube.com/watch?v=gDqQf4Ekr2A&list=PLeo1K3hjS3uu_n_a__MI_KktGTLYopZ12&index=3 Complete playlist:https://www.youtube.com/playlist?list=PLeo1K3hjS3uu_n_a__MI_KktGTLYopZ12 Website: http://codebasicshub.com/ Facebook: https://www.facebook.com/codebasicshub Twitter: https://twitter.com/codebasicshub