DSA-in-Python3

This repo is a WIP that implements all famous data structures and algorithms required for technical interviews from "Cracking the Coding interview" by Gayle Laakmaan, in Python3. Data Strucutres implemented so far:

1. Linked List
2. Hash Table with Chained Collision addressing
3. Stacks
4. Queues
5. Tree
6. Binary Tree

Algorithms implemented so far:

1. Depth First Search (Inorder, Preorder, Postorder) - Recursively
2. Depth First Search (Inorder, Preorder, Postorder [with 1 and 2 stacks]) - Iteratively
3. Breath First Search - Iteratively using Queue
4. Binary Tree Depth using BFS(with and without log) and Recursion
5. PostOrder, PreOrder and InOrder traversal using OneStack
6. Check Balaned Binary Tree
7. Maximum Sum Path
8. ZigZag Traversal
9. Identical Trees
10. Vertical Order Traversal
11. Binary Tree Diameter
12. Check for Balanced Binary Tree
13. Child Sum Property
14. Lowest Common Ascestor
15. Root to all leaves path
16. Top View
17. Bottom View
18. Right View

Acknowledgments

• FreeKaTreeSeries by striver_79
• Cracking The Coding Interview by Gayle Laakmann
• LeetCode