LeetCode Solutions

---

📖 Overview

This repository contains my Python solutions to various LeetCode problems, organized by difficulty: Easy, Medium, and Hard.

Each solution includes:

• ✅ Clean & Readable Python Code
• ✅ Explanation of Approach (where applicable)
• ✅ Complexity Analysis (Time & Space)

---

✨ Features

• 🧩 Categorized by difficulty (Easy / Medium / Hard)
• 📂 Organized by LeetCode problem number & title
• 📝 Explanations & comments in code
• 🚀 Continuously updated with new solutions

---

📂 Repository Structure

LeetCode-Solutions/
│
├── easy/
│   ├── 0001_Two_Sum.py
│   ├── 0053_Maximum_Subarray.py
│   └── ...
│
├── medium/
│   ├── 0015_3Sum.py
│   ├── 0198_House_Robber.py
│   └── ...
│
├── hard/
│   ├── 0042_Trapping_Rain_Water.py
│   └── ...
│
└── README.md

---

🚀 Getting Started

1️⃣ Clone the Repository

git clone https://github.com/sdivyanshu90/LeetCode-Solutions.git
cd LeetCode-Solutions

2️⃣ Run a Solution

To test a specific solution:

python easy/0001_Two_Sum.py

---

✅ Contributing

Contributions are welcome! 🚀 If you’d like to add solutions, improve explanations, or reorganize content:

1. Fork the repo
2. Create a new branch (feature/new-solution)
3. Commit your changes
4. Open a Pull Request

---

📝 License

This project is licensed under the MIT License – see the LICENSE file for details.

---

🙌 Acknowledgments

• Thanks to LeetCode for the amazing problem sets.
• Inspired by the coding community & open-source contributors.