Important Data Structures and Algorithms.
- Binary Search (TopCoder)
- Sieve
- Catalan Numbers
- Sliding Window Technique
- Recursion and Backtracking
- N_Queens (BacktoBackSWE)
- Tortoise and Hare Pointer
- Count Set Bits
- Search, Insert, Delete, Find
- Leetcode List
- Geeks for Geeks Top 20
- Aditya Verma Playlist
- AtCoder DP contest
- Top Code DP tutorial (Did novice and intermediate)
- Watch Tushar Roy Videos
- 0-1 BFS
- BFS
- BFS - 2d matrix
- BFS - Shortest Path in Unweighted Graph
- BFS - Bi-partite Graph
- BFS - Bi-Directional BFS
- DFS
- DFS - Connected Components
- DFS - All Ancestors in DAG
- DFS - Calculate entry and exit time
- DFS - Topological Sort
- DFS - 2d matrix
- DFS - Graph Colouring to Find Cycle
- DFS - LCA
- Dijisktra **
- Disjoint Set Union **
- Kruskal using DSU
- Various Types of Hashing
- Rolling Hash
- Insert
- Delete Nth Node
- Reverse
- Merge Two Sorted Linked List
- Fast Pointer, Slow Pointer technique
- Doubly Linked List
- Bubble Sort
- Insertion Sort
- Quick Sort
- Merge Sort
- Inversion Count
- Count Numbers Larger and Smaller than Self
- Radix Sort
- Count Sort
- Heap Sort
- Binary Search
- LRU Cache
- LFU Cache
- Flatten Tree
- Height of Tree
- Iterative Traversals
- Lowest Common Ancestor
- Level Order Traversal
- Diameter of a Binary Tree
- Recursive Traversals
- Diagonal Traversal
- Vertical Traversal
- Serialize and Deserialize Trees
- Trie
- Manacher's Algorithm
- Rabin Karp
- Palindrome Type Questions
- Max Stack
- Design twitter
- SJF
- FCFS
- Round Robin
- Print numbers in sequence using different threads.
- Bounded Buffer Problem
- Dining Philosophers Problem
- The Readers Writers Problem
- LRU Cache
- Banker's Algorithm
- Binary Indexed Tree
- Segment Tree
- Segment Tree (RMQ)
- AVL Tree
- KMP
- Cartesian Tree
- Floyd Warshall
- Convex Hull
- Line Sweep
- Manacher's Algorithm
- All applications of DSU