LeetCode Solutions 🧠

A collection of my solutions to LeetCode problems, organized by topic and difficulty. This repository is part of my learning journey in data structures, algorithms, and problem-solving for technical interviews.

---

📌 About

This repo includes:

• ✅ Clean and optimized code for each problem
• 🧪 Solutions primarily in Python
• 📂 Folder structure organized by problem category
• 📚 Regular updates as I solve more problems

The goal is to make this repository a useful reference for others preparing for interviews.

---

📂 Folder Structure

LeetCode-Solutions/
├── Arrays/
│ ├── two_sum.py
│ ├── best_time_to_buy_and_sell_stock.py
│ ├── find_closest_number_to_zero.py
│ └── summary_ranges.py
│
├── Strings/
│ ├── roman_to_integer.py
│ ├── merge_strings_alternatively.py
│ └── longest_common_prefix.py
│
├── TwoPointers/
│ ├── is_subsequence.py
│ ├── palindrome_number.py
│ └── summary_ranges.py
│
├── HashMap/
│ ├── two_sum.py
│ └── roman_to_integer.py
│
└── DynamicProgramming/
└── best_time_to_buy_and_sell_stock.py

🚀 How to Use

1. Clone the repository:

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

Browse by folder or search directly for problems by name.

Each file contains:

The problem description as a comment (optional)

A clean solution

(Future): Optimized versions or explanations

🔖 Tags

#python #leetcode #dsa #interview-prep #arrays #strings #hashmap #twopointers #dynamicprogramming #stack #greedy

📅 To-Do (Coming Soon)

Add explanations to each solution

Include links to problems on LeetCode

Add complexity analysis (Time/Space)

Create index.json or table.md for easy reference

🤝 Contributing

This is a personal repo, but feel free to suggest improvements or fork it for your own prep. Feedback and suggestions are welcome!

👨‍💻 Author

Ashiq
💡 Focused on Python, backend development, and open-source
📫 Reach me on GitHub