| Data Structures |
|---|
| 1. Array |
| 2. Linked List |
| 3. Stack |
| 4. Queue |
| 5. Hash Table |
| 6. Tree |
| 7. Graph |
| 8. Heap |
| 9. Trie |
| 10. Disjoint Set |
| 11. Segment Tree |
| 12. Fenwick Tree |
| Sorting Algorithms | Details |
|---|---|
| 1. Bubble Sort | |
| 2. Selection Sort | |
| 3. Insertion Sort | |
| 4. Merge Sort | |
| 5. Quick Sort | |
| 6. Heap Sort | |
| 7. Radix Sort |
| Searching Algorithms | Details |
|---|---|
| 1. Linear Search | |
| 2. Binary Search |
| Graph Algorithms | Details |
|---|---|
| 1. Depth-First Search (DFS) | DFS |
| 2. Breadth-First Search (BFS) | BFS |
| 3. Dijkstra's Algorithm | Dijkstra's Algorithm |
| 4. Bellman-Ford Algorithm | Bellman-Ford Algorithm |
| 5. Kruskal's Algorithm | Kruskal's Algorithm |
| 6. Prim's Algorithm | Prim's Algorithm |
| Dynamic Programming | Details |
|---|---|
| 1. Fibonacci Sequence | Fibonacci |
| 2. Longest Common Subsequence | LCS |
| 3. Knapsack Problem | Knapsack Problem |
| 4. Dynamic Programming on Trees | DP on Trees |
| Others | Details |
|---|---|
| 1. Breadth-First Search in a Matrix | BFS in Matrix |
| 2. Topological Sorting | Topological Sorting |
| 3. Union-Find (Disjoint Set Union) | Union-Find |