Data Structures and Algorithms
I have implements below ones :
- Heap sort
- Dijkstra's algorithm
- Topological sort
- Range minimum query using Sparse table
- LRU Cache
- LFU Cache
- Knuth Morris Pratt Algorithm
- Trie
- Maximum Product Subarray
- Insert Delete GetRandom O(1) - Duplicates allowed
Interview preparation: (Useful articles from geeksforgeeks)
https://www.geeksforgeeks.org/clone-binary-tree-random-pointers/
https://www.geeksforgeeks.org/minimum-number-swaps-required-sort-array/
https://www.geeksforgeeks.org/sort-an-array-of-0s-1s-and-2s/?ref=leftbar-rightbar
https://www.geeksforgeeks.org/rearrange-given-array-place/
https://www.geeksforgeeks.org/rearrange-array-arrj-becomes-arri-j/
https://www.geeksforgeeks.org/number-swaps-sort-adjacent-swapping-allowed/