Welcome to my DSA Solutions repository! Here, you'll find my implementations of various data structures and algorithms, primarily focused on solving problems from LeetCode using python. 🚀
- Problem Solving: Solutions to various algorithmic problems.
- Structured Code: Organized and easy-to-follow code with comments.
- Detailed Explanations: Each solution includes an explanation of the approach used.
- Visual Aids: Diagrams and animations to help understand complex concepts.
- Programming Languages:
- Python 🐍
- Tools:
- LeetCode 🔗
- Visual Studio Code 🖥️
| Algorithm/DS | Best Case | Average Case | Worst Case | Space Complexity |
|---|---|---|---|---|
| Binary Search | O(1) | O(log n) | O(log n) | O(1) |
| Quick Sort | O(n log n) | O(n log n) | O(n^2) | O(log n) |
| Merge Sort | O(n log n) | O(n log n) | O(n log n) | O(n) |
| BFS | O(V + E) | O(V + E) | O(V + E) | O(V) |
| DFS | O(V + E) | O(V + E) | O(V + E) | O(V) |
- Clone this repository:
git clone https://github.com/negativenagesh/DSA.git-
Navigate to the desired problem.
-
Run the solution using your preferred programming language.
Contributions are welcome! If you want to add your solutions or improve existing ones:
-
Fork the repository.
-
Create a new branch
git checkout -b feature/YourFeature- Make your changes.
- Commit your changes
git commit -m 'Add some feature'- Push to the branch
git push origin feature/YourFeature- Open a Pull Request.
Feel free to reach out if you have any questions or suggestions!
Email: gaonkarsub@gmail.com
GitHub: negativenagesh