- ☕ 1. Java & OOPs → Link
- 🧺 2. Collections in Java → Link (💡 do Basic DSA first)
- ⏱️ 3. Time & Space Complexity → Link
- 🔁 3.5. Revision (Love Babbar) → Link (Lectures 8, 22, 23-24-25)
- 🔷 4. Patterns with Time Complexity Analysis → Link
- 🧠 5. Basic DSA → GFG Course
- 🚀 6. Advanced DSA → No specific Playlist [Mostly follow Striver]
- 🧩 7.1. System Design: Low Level Design & Problems → Link
- 🌐 7.2. System Design: High Level Design → Link
➕ Extra Things in Java
- Array → Operations in Array, Largest Element, Second Largest Element, Reverse an Array, Check if Array is Sorted, Remove Duplicates, Left Rotate Array, Move Zeros to End
- Recursion → Natural Number, Palindrome Number, Sum of Digits, Rope Cutting, Generate Subsets (no need Tower of Hanoi)
- Hashing → Only theory, no need to solve any questions
- Searching → Simple Search, Binary Search [Recursion + Iterative], Ternary Search (if want)
- Sorting → 5 main sorts + Hash Sort (only see, no need to remember)
- Linked List
- i. Singly → Traverse, Search, Insert, Delete, Reverse
- ii. Doubly → Insert, Delete, Reverse
- iii. Circular → Traverse, Insert, Delete
- Stack → Implement using Array and using Linked List
- Queue → Using Array, using Linked List
- Dequeue → Array-based Implementation
- Tree → Traversal, Level Order, Max, Size, Height
- BST → Search, Insert, Deletion, Ceil, Floor
- Heap → Insertion and Heapify (properly understand)
🔄 Will Update Soon
🔄 Will Update Soon
🔄 Will Update Soon
🔄 This section will be updated soon.