🧠 LeetCode Solutions in Python

Welcome to my LeetCode Solutions Repository!
This repository contains my solutions to various LeetCode problems, all implemented in Python.
The goal of this project is to improve problem-solving skills, master data structures & algorithms, and maintain a well-structured reference for future use.

---

📂 Repository Structure

Each folder represents a data structure or topic category.
Inside each folder, you’ll find Python files named according to the problem they solve.

LeetCode-Solutions/
│
├── Arrays/
│   ├── two_sum.py
│   ├── max_subarray.py
│   └── ...
│
├── LinkedList/
│   ├── reverse_linked_list.py
│   └── merge_two_sorted_lists.py
│
├── Strings/
│   ├── valid_anagram.py
│   ├── longest_palindromic_substring.py
│   └── ...
│
├── Stack/
│   ├── valid_parentheses.py
│   └── min_stack.py
│
├── Tree/
│   ├── binary_tree_inorder_traversal.py
│   └── maximum_depth_of_binary_tree.py
│
└── README.md

---

⚙️ How to Use

1. Clone the repository

   git clone 'https://github.com/Gauravgit97/LeetCode.git'

2. Navigate to the project folder

   cd LeetCode

3. Open any folder (e.g., Arrays) and run a Python file

   python arrays/twoSum.py

---

🧩 Topics Covered

• Arrays
• Strings
• Linked Lists
• Stacks & Queues
• Trees
• Graphs
• Dynamic Programming
• Recursion
• Sorting & Searching

---

💡 Approach

Each problem solution includes:

• Problem statement (brief summary)
• Approach explanation (logic used)
• Python implementation
• Time & Space Complexity analysis

---

🚀 Goals

• Maintain consistency in solving problems daily
• Improve algorithmic thinking and Python coding skills
• Build a personal DSA reference repository

---

🤝 Contributing

If you’d like to contribute or suggest improvements, feel free to:

1. Fork this repo
2. Create a new branch (feature/your-feature)
3. Commit your changes
4. Submit a Pull Request 🚀

---

⭐ If you found this helpful, don’t forget to star the repository!