- ✅ Daily practice of 1-3 LeetCode problems
- ✅ Build strong fundamentals in core DSA topics
- ✅ Improve problem-solving speed for interviews & contests
- ✅ Track personal progress with commit history
- Language: Java (main)
- IDE: IntelliJ / VS Code
- Platform: LeetCode
- Arrays & Strings
- HashMaps & HashSets
- Recursion & Backtracking
- Trees & Binary Search Trees (BST)
- Heaps & Priority Queues
- Sliding Window & Two Pointers
- Greedy Algorithms
- Dynamic Programming (DP)
- Bit Manipulation
- Graphs
- DFS (Depth-First Search)
- BFS (Breadth-First Search)
- Union Find (Disjoint Set Union)
- Sorting & Searching
- Stacks & Queues
- Linked Lists (Singly, Doubly, Circular)
- Tries (Prefix Trees)
- Binary Search (on arrays and answers)
- Matrix Problems
- Topological Sorting
- Divide and Conquer
- Monotonic Stack & Monotonic Queue
- Number Theory & Math
- Prefix Sum & Difference Array
- Segment Trees & Binary Indexed Trees (Fenwick Tree)
- Suffix Arrays & String Matching (KMP, Rabin-Karp)
- Game Theory & Minimax
- Memoization & Tabulation
- Custom Comparators & Lambda Functions
- Object-Oriented Problem Solving
- Ternary Search
- Reservoir Sampling & Randomized Algorithms
I update this repository regularly with solved problems.
You can check the commit history to view daily activity and topics practiced.
- Browse to a folder by topic
- Open the
.javafiles for each problem - Code is well-commented for learning purposes
- Run using any Java IDE or CLI
If you're also grinding DSA or preparing for tech interviews, feel free to fork, star ⭐, or reach out.
This repository is for learning, revision, and interview preparation only.
I try to write clean, readable, and optimized code.