Skip to content

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

837 Commits
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

LeetCode Solutions 🌟

Welcome to my LeetCode Solutions Repository! This repository is a collection of solutions to coding problems on LeetCode. It serves as a personal resource for tracking progress, refining problem-solving skills, and sharing approaches to various challenges.

📂 Repository Structure

The repository is organized as follows:

LeetCode/
├── Problems/
│   ├── 0001_Two_Sum/
│   │   ├── solution.py
│   │   ├── README.md
│   ├── 0002_Add_Two_Numbers/
│   │   ├── solution.py
│   │   ├── README.md
│   ├── ...
└── README.md

Folders Overview:

  • Problems/: Each LeetCode problem is organized into its own folder with a name in the format <problem-number>_<problem-name>. Each folder contains:
    • solution.py: The Python solution for the problem.
    • README.md: A markdown file containing the problem description, solution approach, and complexity analysis.

🚀 Getting Started

Clone the Repository:

git clone https://github.com/msnabiel/LeetCode.git
cd LeetCode

Explore Solutions:

  • Navigate to the Problems/ folder and locate the solution for any problem using its LeetCode number and name.

Run a Solution:

  • Use Python to execute any solution file. Example: python Problems/0001_Two_Sum/solution.py

🌟 Features

  • Organized by Problem: Each problem is self-contained in its own folder.
  • Detailed Documentation: Each solution includes a README with problem descriptions.
  • Continuously Updated: Regularly updated with new problems and approaches.

✨ Topics Covered

This repository spans a wide range of topics, including:

  • Arrays
  • Strings
  • Dynamic Programming
  • Graphs
  • Trees
  • Backtracking
  • Sliding Window
  • Two Pointers
  • Binary Search
  • Greedy Algorithms
  • Bit Manipulation
  • Divide and Conquer
  • Recursion
  • Heaps
  • Stacks and Queues
  • Tries
  • Union Find

🤝 Contributing

Contributions are welcome! If you'd like to add a new solution, improve an existing one, or suggest enhancements, follow these steps:

  1. Fork the repository.
  2. Create a new branch: git checkout -b feature/your-feature-name
  3. Commit your changes: git commit -m 'Add some feature'
  4. Push to the branch: git push origin feature/your-feature-name
  5. Submit a pull request.

🧑‍💻 About Me

Hi there! I'm Nabiel, a passionate programmer and engineering student with a knack for solving problems. This repository is part of my coding journey, and I'm excited to share it with the community.

Let's Connect:

📜 License

This repository is licensed under the MIT License. You are free to use the code for personal or educational purposes.

Happy Coding! 😊

About

Leetcode Solutions - Documenting my journey.

Resources

Stars

Watchers

Forks

Releases

Packages

Contributors

Languages