https://github.com/umbertodellamonica/leet-by-leet
🚀 Mastering coding one problem at a time. This repository contains efficient, well-documented solutions to LeetCode challenges, from brute force to optimized algorithms.
https://github.com/umbertodellamonica/leet-by-leet
algorithm-challenges algorithms bigocomplexity coding-challenges competitive-programming datastructures-algorithms leetcode leetcode-cpp leetcode-java leetcode-python leetcode-solutions
Last synced: 3 months ago
JSON representation
🚀 Mastering coding one problem at a time. This repository contains efficient, well-documented solutions to LeetCode challenges, from brute force to optimized algorithms.
- Host: GitHub
- URL: https://github.com/umbertodellamonica/leet-by-leet
- Owner: UmbertoDellaMonica
- License: mit
- Created: 2025-07-17T11:39:17.000Z (3 months ago)
- Default Branch: production
- Last Pushed: 2025-07-18T15:30:23.000Z (3 months ago)
- Last Synced: 2025-07-18T15:38:47.148Z (3 months ago)
- Topics: algorithm-challenges, algorithms, bigocomplexity, coding-challenges, competitive-programming, datastructures-algorithms, leetcode, leetcode-cpp, leetcode-java, leetcode-python, leetcode-solutions
- Language: Python
- Homepage:
- Size: 17.6 KB
- Stars: 0
- Watchers: 0
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
- License: LICENSE
Awesome Lists containing this project
README
# 🧠 leet-by-leet
Welcome to **leet-by-leet** – a curated collection of elegant and well-documented solutions to problems from [LeetCode](https://leetcode.com/). This repository is meant to **track**, **explain**, and **celebrate** the journey of solving problems, categorized by difficulty and algorithmic theme.
---
## 🚀 Features
* ✅ Clear and well-documented solutions
* 🧮 Categorized by difficulty: `Easy`, `Medium`, `Hard`
* 🔍 Explanations and complexity analysis
* 🧠 Educational, Clean, and Readable Python code
* 📁 Structured for effortless navigation
---
## 📁 Repository Structure
```
leet-by-leet/
├── easy/
│ ├── climbing-stairs/
│ ├── roman-to-integer/
│ └── ...
├── medium/
│ ├── pascal-triangle/
│ ├── pascal-triangle-ii/
│ └── ...
├── hard/
│ └── ...
└── README.md
```
---
## 📁 Solved Problems
### 🟢 Easy
* [Climbing Stairs](./easy/70-Climbing-Stairs/docs-problem.md) — *Dynamic Programming, Iterative*
* [Pascal's Triangle](./easy/118-Pascal-Triangle/docs-problem.md) — *Array Construction*
* [Pascal's Triangle II](./easy/119-Pascal-Triangle/docs-problem.md) — *Recursion, Memoization*
### 🟡 Medium
* [Integer to Roman](./medium/12-Integer-to-Roman/docs-problem.md) — *Hash Table, String Parsing*
* [Longest Substring Without Duplicate characters](./medium/3-Longest-Substring-Without-Repeating-Characters/docs-problem.md) — *String Parsing*
* [Longest Palindromic Substring](./medium/5-Longest-Palindromic-Substrings/docs-problem.md) — *String Parsing*
* [Zig-Zag Conversion](./medium/6-Zig-Zag-Conversion/docs-problem.md) — *String Parsing*
### 🔴 Hard
* *Coming soon...*
---
## 🧩 Why This Project?
LeetCode is more than just a platform – it's a training ground for problem-solving, algorithmic thinking, and coding interviews. **leet-by-leet** serves as both a reference and a personal challenge tracker, documenting not only solutions, but *thought processes and optimizations*.
---
## 🏁 How to Use
1. Clone the repository:
```bash
git clone https://github.com/UmbertoDellaMonica/leet-by-leet.git
```
2. Browse by difficulty level.
3. Read the explanations and run the solutions.