Welcome to my LeetCode Solutions Repository, where I document my journey of solving Data Structures and Algorithms problems using Python / Java / C++. This repo is built to:
- Improve problem-solving skills 🔍
- Prepare for technical interviews 👨💻
- Master DSA from beginner to advanced 💡
- Build a consistent streak with daily progress 📈
| Category | Subtopics |
|---|---|
| Arrays | Sorting, Searching, Sliding Window, 2D Arrays |
| Strings | Anagrams, Palindromes, Pattern Matching |
| Linked Lists | Singly, Doubly, Merge, Reverse |
| Trees | Binary Trees, BST, Traversals |
| Graphs | DFS, BFS, Topological Sort, Shortest Path |
| DP | Memoization, Tabulation, 0/1 Knapsack |
| Backtracking | Sudoku, N-Queens, Subsets |
| Stacks & Queues | Monotonic, Min Stack, Circular Queue |
| Math & Logic | Prime Numbers, Bit Manipulation, GCD, LCM |
Leetcode-Solutions/ ├── Arrays/ ├── Strings/ ├── LinkedList/ ├── Trees/ ├── Graphs/ ├── DynamicProgramming/ ├── Backtracking/ ├── Math/ └── README.md
Each folder contains:
- ✅ Problem statement (commented)
- ✅ Time and space complexity
- ✅ Optimized code solution
- ✅ Clean and readable format
- Clone this repo:
git clone https://github.com/its-pratyushpandey/Leetcode-Solutions.git