A collection of LeetCode problem solutions implemented in Python, organized for technical interview preparation.
| # | Problem | Difficulty |
|---|---|---|
| 1 | Two Sum | Easy |
| 26 | Remove Duplicates from Sorted Array | Easy |
| 27 | Remove Element | Easy |
| 88 | Merge Sorted Array | Easy |
| 136 | Single Number | Easy |
| 217 | Contains Duplicate | Easy |
| 268 | Missing Number | Easy |
| 283 | Move Zeroes | Easy |
| 448 | Find All Numbers Disappeared in an Array | Easy |
| 485 | Max Consecutive Ones | Easy |
| 414 | Third Maximum Number | Easy |
| 977 | Squares of a Sorted Array | Easy |
| 905 | Sort Array By Parity | Easy |
| 941 | Valid Mountain Array | Easy |
| 1051 | Height Checker | Easy |
| 1089 | Duplicate Zeros | Easy |
| 1299 | Replace Elements with Greatest Element on Right Side | Easy |
| 1346 | Check If N and Its Double Exist | Easy |
| 2022 | Convert 1D Array Into 2D Array | Easy |
| # | Problem | Difficulty |
|---|---|---|
| 69 | Sqrt(x) | Easy |
| # | Problem | Difficulty |
|---|---|---|
| 392 | Is Subsequence | Easy |
| 844 | Backspace String Compare | Easy |
| # | Problem | Difficulty |
|---|---|---|
| 175 | Combine Two Tables | Easy |
Each solution file follows the naming convention: [Problem Number]. [Problem Title].py
Solutions include:
- Clean, readable implementations
- Type hints
- Test cases with assertions
Run any solution file directly:
python "136. Single Number.py"MIT License - See LICENSE file for details.