firattamur / leetcode-python

Leetcode Problems' Solutions in Python.

📚 LeetCode Solutions in Python

Welcome to repository of LeetCode solutions in Python! This repository contains my solutions for LeetCode problems between 21 and 40. All solutions are optimized for readability and performance.

📘 Introduction

This repository contains my personal solutions for LeetCode problems. All solutions are written in Java and are optimized for readability and performance.

📝 Table of Contents

#	Problem Name	Level	Status
0001	Two Sum	Easy	✅ Completed
0021	Merge Two Sorted Lists	Easy	✅ Completed
0022	Generate Parentheses	Medium	✅ Completed
0023	Merge k Sorted Lists	Hard	✅ Completed
0024	Swap Nodes in Pairs	Medium	✅ Completed
0025	Reverse Nodes in k-Group	Hard	✅ Completed
0026	Remove Duplicates from Sorted Array	Easy	✅ Completed
0053	Maximum Subarray	Medium	✅ Completed
0027	Remove Element	Easy	✅ Completed
0121	Best Time to Buy and Sell Stock	Easy	✅ Completed
0217	Contains Duplicate	Easy	✅ Completed
0238	Product of Array Except Self	Medium	✅ Completed

🎯 How to Use

To get started, simply clone this repository to your local machine:

git clone https://github.com/firattamur/leetcode-python.git

Once the repository is cloned, you can navigate to the specific problem folders and check out the solution files. Each solution file is named after the problem's title and includes a link to the problem description on the LeetCode website. Feel free to study the solutions and try them out on your own.

🤝 Contribution

Contributions to this repository are always welcome! If you have any suggestions, improvements, or alternative solutions, please feel free to create a pull request or open an issue. Make sure your solution is well-commented, efficient, and follows the existing naming conventions.

📜 License

This repository is licensed under the MIT License.