How to Implement Linked List in Python | Time + Space Complexities | Add, Remove, Reverse, and More
Implement a Linked List in Python, with time and space complexities.
Extremely important for coding interviews.
Watch this video to see how can you achieve the best time and space complexities of O(1) for add, remove, reverse and more.
Coding interview
Software engineer interview
software developer interview
sde interview
implementing linked list
linkedlist
linked list implementation
#linkedlist #linkedlistpython #python #pythonprogramming #pythontutorial #datastructures #computerscience
0:00-0:22 Introduction
0:23-0:41 class Node
0:42-1:02 __init__() / Constructor
1:03-1:57 add_first()
1:58-3:26 add_last()
3:29-4:17 add_after_node()
4:19-4:37 get_first()
4:38-5:30 get_last()
5:31-6:55 get()
6:56-7:49 find_value()
7:49-8:27 remove_first()
8:28-10:14 remove_last()
10:14-11:02 remove_after_node()
11:02-11:42 print()
11:53-13:24 reverse()
13:30-14:34 Testing
14:34 Conclusion
