- This Repo contain code on basic data structure and algorithms in Python and Javascript.
-
Time Complexity
- O(1) - constant time
- O(log n)
- O(n)
- O(n log n)
- O(n^2)
- O(2^n)
- O(n!)
-
Space Complexity
- Sorting (Quick, Merge Sort, Bucket sort, Selection sort, Bugo sort, Insertion sort, Radix sort)
- Searching (Linear search, Binary Search)
- Tree Transversal (preorder, uniorder, postorder)
- BFS and DFS (Breath First Search and Depth First Search)
- Recursion
- Divide and Conquer
- Greedy Algorithm
- Brute Force Algorithn
- Dynamic algorithm
- Finding all Permutation and Combination
- Array
- List (Linked list, Doubly Linked List, Circular Linked list)
- Stack
- Queue
- Binary tree (Balance and Complete tree)
- Binary Search tree
- Graph (Directed and Unidirected)
- Map and sets
- Heaps (Min and Max Heaps)
- Union - Find
- Trees