Implementation of common Data Structures and Algorithms in Python3. Please note that this is not an optimized version, and involves extensive assumptions about input/output behavior. These are done for understanding only, not for integration in any existing system.
Books used:
- Data Structures and Algorithms with Python (https://link.springer.com/book/10.1007/978-3-319-13072-9)
- Algorithm Design Manual (https://link.springer.com/book/10.1007/978-3-030-54256-6)
Data Structures studied and implemented (not all):
- Arrays/Lists
- Linked List
- Stack
- Queue
- Hash Set
- Hash Map
- Adjaceny List (graphs)
- Heap
- Binary Search Tree
Algorithms studied and implemented (not all):
- Merge Sort
- Quick Sort
- Selection Sort
- Heap Sort
- Breadth First Search
- Depth First Search