Your go-to resource guide for mastering Data Structures & Algorithms (DSA) A Bundle of my DSA + CP + Interview preparation
LeectCode Solutions available in: C, C++, C#, Java, JavaScript, Python, TypeScript
This repository is designed to streamline your DSA learning journey, inspired by a 12-week university curriculum. It includes concise notes, curated video lectures, coding assignments, and problem applications—all in one place.
✅ A progress tracking sheet and structured 12-week roadmap are
IN DEVELOPMENTto help you stay consistent and monitor your growth.
- 📓 Lectures – Summarized concepts from each module.
- 🚀 Applications – Real-world use cases and LeetCode-style problems.
- 🧠 Assignments – Practice problems based on lecture content.
- 💡 LeetCode Solutions – Solutions aligned with common interview questions.
- ⭐ Problems of the week – Most repeated MAANG Stuff.
- 🔗 Reference Course – Full course by Kunal Kushwaha.
| Module | Topic |
|---|---|
| Java Basics | Loops & Conditions |
| Functions & Recursion | |
| OOP Basics | |
| Time Complexity | Big-O Notation |
| Recursion Complexity | |
| Sorting & Searching | Bubble Sort |
| Merge Sort | |
| Quick Sort | |
| Binary Search | |
| Sliding Window | |
| Recursion & Backtracking | Subsets & Subsequences |
| N-Queens | |
| Sudoku Solver | |
| Rat in a Maze | |
| Stack & Queue | Stack Operations |
| Queue Operations | |
| Deque | |
| Linked List | Singly & Doubly Linked List |
| Cycle Detection | |
| Linked List Reversal | |
| Hashing | HashMap & HashSet |
| Two Sum Problem | |
| Trees | Tree Traversals |
| BST Operations | |
| Lowest Common Ancestor | |
| Heaps | Min & Max Heap |
| Heap Sort | |
| Graphs | BFS & DFS |
| Dijkstra’s Algorithm | |
| Minimum Spanning Tree | |
| Dynamic Programming | 1D DP - Fibonacci |
| Knapsack Problem |
⭐ Whether you're preparing for coding interviews or brushing up for your CS classes, this guide is built to support your consistent practice.