| Topic | Days | Importance | Status |
|---|---|---|---|
| Arrays | 10 | ⭐⭐⭐⭐ | Not Started |
| Two Pointer & Sliding Window | 5 | ⭐⭐⭐ | Not Started |
| String | 5 | ⭐⭐⭐⭐ | Not Started |
| Stack & Queue | 7 | ⭐⭐⭐⭐ | Not Started |
| LinkedList | 7 | ⭐⭐⭐ | Not Started |
| Binary Search | 10 | ⭐⭐⭐⭐ | Not Started |
| Bit Manipulation | 7 | ⭐⭐⭐ | Not Started |
| Recursion & Backtracking | 7 | ⭐⭐⭐⭐⭐ | Not Started |
| Greedy Algorithm | 5 | ⭐⭐⭐ | Not Started |
| Heaps | 5 | ⭐⭐⭐ | Not Started |
| Binary Tree & BST | 30 | ⭐⭐⭐⭐⭐ | Not Started |
| Dynamic Programming | 30 | ⭐⭐⭐⭐⭐ | Not Started |
| Graph | 30 | ⭐⭐⭐⭐⭐ | Not Started |
| Tries | 5 | ⭐⭐⭐ | Not Started |
| Design Data Structure | 5 | ⭐⭐⭐⭐ | Not Started |
For those aiming to go beyond standard DSA:
- Segment Tree & Fenwick Tree (BIT) – For efficient range queries and updates.
- Disjoint Set Union (Union-Find) – Used in Kruskal’s MST and cycle detection in graphs.
- KMP & Rabin-Karp Algorithm – Essential for efficient string pattern matching.
- Number Theory & Mathematics – Covers GCD, LCM, Modular Arithmetic, and Prime Factorization.
- Advanced Graph Algorithms – Includes Tarjan’s (SCC), Floyd-Warshall, and Johnson’s Algorithm.
- Suffix Array & Suffix Tree – Useful for advanced string matching problems.
- Mo’s Algorithm – Optimized approach for answering range queries offline.
- Game Theory – Includes Grundy numbers, Nim Game, and optimal strategies.
- Trie + Bit Manipulation – Useful for problems involving XOR queries and efficient searching.
- Heavy-Light Decomposition (HLD) – Advanced technique for handling tree queries efficiently.
- Finish the learning part ASAP so that we can start our practice as soon as possible. This will build your confidence and, most importantly, prevent getting stuck in the loop of endless learning.
- Be ready for practice and improve your problem-solving skills.
This is very helpful thanks for your time and efforts, you are such a great mentor.