FAANG LeetCode Solutions (Python)

Welcome to the FAANG LeetCode Solutions (Python) repository! This repository contains solutions to LeetCode problems commonly asked by FAANG companies (Facebook, Amazon, Apple, Netflix, Google) in their coding interviews. The solutions are written in Python.

🚀 Repository Structure

The repository is organized into different patterns of problems, with each pattern containing individual solutions. Below is the structure:

🗂️ Root Directory

• README.md: The main README file.
• LICENSE: The license for this project.
• .gitignore: Git ignore file.
• patterns/: Directory containing pattern based problems.
• utils/: Directory containing utility functions and helper scripts.

📂 Patterns Directory

• sliding_window/: Solutions to sliding window related problems.
  • README.md: Overview of sliding window technique and problems.
  • 209_minimum_size_subarray_sum.py
  • ...

📝 How to Use

1. Clone the repository:

   git clone git clone https://github.com/abirhussain/faang-leetcode-problems-python.git

2. Navigate to the desired category and problem folder to view the solution:

   cd faang-leetcode-problems-python/categories/arrays

3. Run the solution: Each problem file is self-contained and can be run independently. For example, to run 001_two_sum.py:

   python 001_two_sum.py

🤝 Contributing

Contributions are welcome! If you have solutions to add or improvements to make, please follow these steps:

1. Fork the repository
2. Create a new branch:

   git checkout -b feature/your-feature-name

3. Make your changes and commit them:

   git commit -m 'Add some feature'

4. Push to the branch:

   git push origin feature/your-feature-name

5. Open a pull request

📄 License

This project is licensed under the MIT License - see the LICENSE file for details.

📧 Contact

For any questions or feedback, please reach out to abir.hussain.rcc@gmail.com.

Happy Coding! 🎉