A comprehensive collection of LeetCode DSA problems & solutions with detailed explanations.
This repository documents a journey through LeetCode Data Structures and Algorithm problems. It serves as both a personal log and a resource for others studying DSA concepts. Each solution includes detailed explanations, complexity analysis, and alternative approaches where applicable.
- 🎯 Track progress through LeetCode problems
- 📚 Document solutions with clear explanations
- 🧠 Highlight core DSA patterns and techniques
- 📊 Provide visual progress tracking
- 📝 Hash Map Lookups: O(1) access time for finding complements (Two Sum pattern)
- 📝 Two Pointers: Efficient array/string traversal with O(n) time and O(1) space
- 📝 Sliding Window: Tracking subarrays/substrings within a larger array
- 📝 Binary Search: Dividing search space in half for O(log n) time complexity
- 📝 BFS/DFS: Graph and tree traversal techniques for various problems
- 📝 Dynamic Programming: Breaking problems into overlapping subproblems
- 🎯 Complete Top 100 LeetCode interview questions
- 🎯 Solve problems across all difficulty levels
- Browse solutions by day or by data structure/algorithm topic
- Clone the repository to run solutions locally
git clone https://github.com/IsoDevMate/dsa.git - Study the approach in each problem's details section
- Track your own progress by forking this repository and customizing it
Contributions are welcome! If you'd like to contribute:
- Fork the repository
- Create a new branch (
git checkout -b solution/problem-name) - Add your solution with explanation
- Commit your changes (
git commit -m 'Add solution for problem-name') - Push to the branch (
git push origin solution/problem-name) - Open a Pull Request
Happy Coding! 💻
© 2025 | IsoDevMate