https://github.com/negativenagesh/dsa_python
https://github.com/negativenagesh/dsa_python
data-structures-and-algorithms dsa dsa-learning-series dsa-questions python python-dsa-practice
Last synced: 7 months ago
JSON representation
- Host: GitHub
- URL: https://github.com/negativenagesh/dsa_python
- Owner: negativenagesh
- License: mit
- Created: 2024-07-06T17:45:59.000Z (over 1 year ago)
- Default Branch: main
- Last Pushed: 2024-10-15T11:40:52.000Z (about 1 year ago)
- Last Synced: 2025-03-26T06:11:22.341Z (7 months ago)
- Topics: data-structures-and-algorithms, dsa, dsa-learning-series, dsa-questions, python, python-dsa-practice
- Language: Python
- Homepage:
- Size: 279 KB
- Stars: 3
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
- License: LICENSE
Awesome Lists containing this project
README
# 📊 Data Structures and Algorithms (DSA) Solutions
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. 🚀
## 📚 Table of Contents
- [🌟 Features](#-features)
- [🛠️ Technologies Used](#-technologies-used)
- [📑 Time Complexity Table](#-time-complexity-table)
- [📖 How to Use](#-how-to-use)
- [💬 Contributing](#-contributing)
- [📧 Contact](#-contact)
## 🌟 Features
- **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.
## 🛠️ Tech stack
- **Programming Languages:**
- Python 🐍
-
- **Tools:**
- LeetCode 🔗
- Visual Studio Code 🖥️
## 📑 Time Complexity Table
| 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) |
## 📖 How to Use
1. Clone this repository:
```bash
git clone https://github.com/negativenagesh/DSA.git
```
2. Navigate to the desired problem.
3. Run the solution using your preferred programming language.
## 💬 Contributing
Contributions are welcome! If you want to add your solutions or improve existing ones:
1. Fork the repository.
2. Create a new branch
```bash
git checkout -b feature/YourFeature
```
3. Make your changes.
4. Commit your changes
```bash
git commit -m 'Add some feature'
```
5. Push to the branch
```bash
git push origin feature/YourFeature
```
6. Open a Pull Request.
## 📧 Contact
Feel free to reach out if you have any questions or suggestions!
Email: gaonkarsub@gmail.com
GitHub: [negativenagesh](https://github.com/negativenagesh)
🎉 Happy Coding! 🎉