This repository contains Python solutions for various LeetCode problems. Each problem is organized in its own directory under the Solution/ folder, with a readme.md file providing the problem description, examples, constraints, and solutions in multiple programming languages.
This repository is designed to help you:
- Master Problem-Solving: Tackle a wide range of LeetCode problems with clear and concise solutions.
- Learn Efficiently: Understand optimized approaches and advanced techniques.
- Stay Motivated: Progress step by step, and see your skills grow with every solved problem.
- Collaborate and Contribute: Join a community of learners and developers to share knowledge and improve together.
Whether you're preparing for coding interviews, enhancing your algorithmic skills, or just exploring the joy of problem-solving, this repository is your companion on the journey to success.
- 🚀 Features
- 📂 Repository Structure
- 🛠️ How to Use
- 🌟 Highlights
- 🤝 Contributing
- 📜 License
- 📊 Statistics
- 📌 Quick Links
- Index of LeetCode Python Solutions
- Comprehensive Solutions: Includes Python solutions for a wide range of LeetCode problems.
- Multi-Language Support: Problem descriptions and solutions are available in multiple programming languages.
- Organized Structure: Each problem is neatly organized in its own directory with a dedicated
readme.mdfile. - Interactive and Informative: Easy-to-navigate structure with detailed explanations and examples.
graph TD
A[Root Directory] --> B[LICENSE]
A --> C[README.md]
A --> D[.gitattribute]
A --> E[Solution/]
A --> E12[gitignore]
A --> E14[workflow]
E --> F[LeetCode Qutions]
F --> |follow instructions| F1[README.md]
G[Readme.md]
F --> |Edit For Contribute| G1[Solutions.py]
- Navigate to the
Solution/folder. - Find the directory corresponding to the problem you are interested in (e.g.,
104. Maximum Depth of Binary Tree). - Open the
readme.mdfile for the problem description, examples, and solutions. - Review the Python solution in the
.pyfile.
- Beginner-Friendly: Solutions are written in a clear and concise manner, making them easy to understand.
- Advanced Techniques: Includes optimized solutions for complex problems.
- Regular Updates: The repository is continuously updated with new problems and solutions.
Contributions are welcome! If you have a better solution or additional test cases, feel free to submit a pull request.
- Fork the repository.
- Create a new branch for your changes.
- Add your solution or update an existing one.
- Commit your changes with a descriptive message.
- Submit a pull request.
graph TD
A[Contributors] --> B[Add New Solutions]
A --> C[Fix Bugs in Existing Solutions]
A --> D[Improve Documentation]
A --> E[Add Test Cases]
B --> F[Python Solutions]
B --> G[Multi-Language Support]
C --> H[Code Optimization]
D --> I[Update README.md]
D --> J[Add Problem Descriptions]
E --> K[Edge Cases]
E --> L[Performance Tests]
graph TB;
A[Contributors] --> B[Fork]
B --> C[Clone in your system]
C --> D[Create Branch]
D --> E[Add Solution or Update Existing One]
E --> F[Commit Changes]
F --> G[Push Changes]
E --> L[Add Performance]
L --> M[Add Test Cases]
M --> N[Add Edge Cases]
N --> O[ Performance Tests] -->H
G --> H[Create Pull Request]
H --> I[Merge Pull Request]
I --> J[Add Reviewer of owner]
J --> K[Add lebels]
This repository is licensed under the MIT License. See the LICENSE file for more details.
- Total Problems Solved: 100+ (and counting!)
- Languages Supported: Python, Java, C++, Go, TypeScript
- Difficulty Levels: Easy, Medium, Hard
This index provides a quick overview of all the problems and solutions available in this repository. Each problem is organized under the Solution/ folder, and older solutions are stored in the privious/ folder.
- 1004. Max Consecutive Ones III
- 104. Maximum Depth of Binary Tree
- 1071. Greatest Common Divisor of Strings
- 11. Container With Most Water
- 1137. N-th Tribonacci Number
- 1143. Longest Common Subsequence
- 1161. Maximum Level Sum of a Binary Tree
- 1207. Unique Number of Occurrences
- 1268. Search Suggestions System
- 1318. Minimum Flips to Make a OR b Equal to c
- 136. Single Number
- 1372. Longest ZigZag Path in a Binary Tree
- 1431. Kids With the Greatest Number of Candies
- 1448. Count Good Nodes in Binary Tree
- 1456. Maximum Number of Vowels in a Substring of Given Length
- 1466. Reorder Routes to Make All Paths Lead to the City Zero
- 1493. Longest Subarray of 1's After Deleting One Element
- 151. Reverse Words in a String
- 162. Find Peak Element
- 1657. Determine if Two Strings Are Close
- 1679. Max Number of K-Sum Pairs
- 17. Letter Combinations of a Phone Number
- 1732. Find the Highest Altitude
- 1768. Merge Strings Alternately
- 1926. Nearest Exit from Entrance in Maze
- 198. House Robber
- 199. Binary Tree Right Side View
- 206. Reverse Linked List
- 208. Implement Trie (Prefix Tree)
- 2095. Delete the Middle Node of a Linked List
- 2130. Maximum Twin Sum of a Linked List
- 215. Kth Largest Element in an Array
- 216. Combination Sum III
- 2215. Find the Difference of Two Arrays
- 2300. Successful Pairs of Spells and Potions
- 2336. Smallest Number in Infinite Set
- 2352. Equal Row and Column Pairs
- 236. Lowest Common Ancestor of a Binary Tree
- 238. Product of Array Except Self
- 2390. Removing Stars From a String
- 2462. Total Cost to Hire K Workers
- 75B. LeetCode 75 Questions
- 2115. Find All Possible Recipes from Given Supplies
- 2206. Divide Array Into Equal Pairs
- 2226. Maximum Candies Allocated to K Children
- 2560. House Robber IV
- 2594. Minimum Time to Repair Cars
- 3356. Zero Array Transformation II
For detailed problem descriptions and solutions, navigate to the respective directories.
