A curated collection of LeetCode problems organized by company, solved using Python. This repository aims to help with technical interview preparation by providing solutions to problems frequently asked by top tech companies.
- Amazon - Frequently asked problems from Amazon interviews
- Google - Google's favorite coding challenges
- Microsoft - Microsoft's common interview questions
- Facebook (Meta) - Problems frequently asked at Meta
- Apple - Apple's interview problems
- Netflix - Netflix-specific challenges
- Other Companies - Problems from Uber, Airbnb, LinkedIn, etc.
Common algorithmic patterns covered in this repository:
- Two Pointers
- Sliding Window
- BFS & DFS
- Dynamic Programming
- Backtracking
- System Design
- Graph Algorithms
- Tree Traversal
- Heap/Priority Queue
- Union Find
- Python 3.8+
- pip (Python package manager)
- Clone the repository:
git clone https://github.com/webjamil101/Python.git
cd Python
- Company-specific Preparation: Focus on problems from your target company
- Pattern Recognition: Study solutions by algorithmic pattern
- Progressive Learning: Start with easy problems and gradually move to harder ones
- Mock Interviews: Use problems for practice interviews
This repository is regularly updated with:
- New company problems
- Optimized solutions
- Additional test cases
- Performance benchmarks
We welcome contributions! Please see our Contributing Guidelines for details.
- Fork the repository
- Create a feature branch
- Add your solution with proper documentation
- Include test cases
- Submit a pull request
We follow PEP 8 guidelines. Please ensure your code is:
- Well-documented with docstrings
- Properly formatted
- Includes time and space complexity analysis
- Has test cases
- LeetCode Extension: For VS Code users
- Python Debugger: For testing solutions locally
- Time Complexity Analyzer: For performance optimization
- LeetCode for providing the platform
- The coding interview community
- Contributors and maintainers
Happy Coding! 🚀
Remember: Consistency is key to mastering coding interviews. Solve at least one problem daily!