| Arrays |
Basics, Traversal, Searching, Sorting, Two-Pointer, Sliding Window |
✅ |
✅ |
✅ |
|
| Strings |
Basics, String Matching, Substrings, Palindrome, Anagram, Pattern Matching |
✅ |
✅ |
✅ |
✅ |
| Linked List |
Singly Linked List, Doubly Linked List, Circular Linked List, Reversal, Detect Cycle |
✅ |
✅ |
✅ |
|
| Stacks |
Stack Operations, Infix/Postfix/Prefix, Balanced Parentheses, Min/Max Stack |
✅ |
✅ |
✅ |
|
| Queues |
Simple Queue, Circular Queue, Deque, Priority Queue, Double-Ended Queue |
✅ |
✅ |
✅ |
|
| Recursion |
Basics, Backtracking, Divide and Conquer, Tail Recursion |
✅ |
✅ |
✅ |
✅ |
| Trees |
Binary Tree, Traversals, Binary Search Tree, Height, Diameter, Lowest Common Ancestor |
✅ |
✅ |
✅ |
✅ |
| Heaps |
Min Heap, Max Heap, Heapify, Heap Sort, Priority Queue |
|
✅ |
✅ |
✅ |
| Hashing |
Hash Table, Hash Map, Collision Handling, Open Addressing, Chaining |
✅ |
✅ |
✅ |
✅ |
| Graphs |
Graph Representation, BFS, DFS, Topological Sort, Dijkstra, Bellman-Ford, Floyd-Warshall, MST |
|
✅ |
✅ |
✅ |
| Dynamic Programming |
Memoization, Tabulation, Fibonacci Variants, Knapsack, LIS, Matrix Chain Multiplication |
|
✅ |
✅ |
✅ |
| Greedy Algorithms |
Activity Selection, Huffman Coding, Minimum Spanning Tree, Job Scheduling |
|
✅ |
✅ |
✅ |
| Searching |
Linear Search, Binary Search, Ternary Search, Search in Rotated Array |
✅ |
✅ |
|
|
| Sorting |
Bubble Sort, Selection Sort, Insertion Sort, Merge Sort, Quick Sort, Counting Sort, Radix Sort |
✅ |
✅ |
✅ |
|
| Bit Manipulation |
Basics, Set/Unset/Toggle Bits, Subsets, XOR Problems, Bitmask DP |
|
✅ |
✅ |
✅ |
| Mathematics |
GCD/LCM, Prime Numbers, Sieve of Eratosthenes, Modular Arithmetic, Combinatorics |
✅ |
✅ |
✅ |
✅ |
| Number Theory |
Modular Exponentiation, Euler?s Totient, Fermat?s Theorem, Chinese Remainder Theorem |
|
|
✅ |
✅ |
| Advanced Trees |
AVL Tree, Red-Black Tree, Segment Tree, Fenwick Tree, Trie |
|
|
✅ |
✅ |
| Advanced Graphs |
Max Flow, Min Cut, Bipartite Matching, Eulerian Path, Hamiltonian Cycle |
|
|
✅ |
✅ |
| Computational Geometry |
Convex Hull, Line Sweep, Closest Pair of Points, Rotating Calipers |
|
|
✅ |
✅ |
| String Algorithms |
KMP, Rabin-Karp, Z Algorithm, Suffix Array, Suffix Tree, LCP Array |
|
✅ |
✅ |
✅ |
| Divide and Conquer |
Binary Search Variants, Matrix Multiplication, Convex Hull (DC Approach) |
✅ |
✅ |
✅ |
✅ |
| Backtracking |
N-Queens, Sudoku Solver, Rat in a Maze, Word Search |
✅ |
✅ |
✅ |
✅ |
| Advanced DP |
DP on Trees, DP on Graphs, Bitmask DP, Digit DP, Probability DP |
|
|
✅ |
✅ |
| Randomized Algorithms |
Randomized QuickSort, Reservoir Sampling, Monte Carlo Algorithms |
|
|
|
✅ |