A personal journal of my path to mastering algorithms, writing efficient code, and implementing CI/CD automation.
Welcome to my personal collection of LeetCode solutions. This repository is not just a code archive, but an active workspace where I develop my problem-solving skills, analyze complexities, and apply software engineering best practices.
The progress tracking and solution tables are automatically generated and updated via a custom GitHub Actions CI/CD pipeline, turning this repository into a fully automated project.
The main goal is not just "passing the tests," but writing code that is:
- ⚡ Efficient: Strong focus on Time Complexity (Big O) and Space Complexity analysis.
- 📖 Readable: Clean, "Pythonic," and well-commented code following PEP 8 guidelines.
- 🛡️ Robust: Proper handling of edge cases, memory safety, and logical structuring.
| Difficulty | Solved | View Solutions |
|---|---|---|
| 🟢 Easy | 32 | 📁 Browse Easy |
| 🟡 Medium | 12 | 📁 Browse Medium |
| 🔴 Hard | 1 | 📁 Browse Hard |
| 🏆 Total | 45 |
| Category | Technologies & Patterns |
|---|---|
| Language | Python 3.x |
| Automation & DevOps | GitHub Actions, Python Scripting (for dynamic README generation) |
| Key Algorithms | Binary Search, DFS / BFS, Sorting, Dynamic Programming |
| Core Patterns | Two Pointers, Sliding Window, Greedy, Bit Manipulation |
| Documentation | Comprehensive docstrings, Step-by-step Big O analysis per solution |
leetcode-journey/
├── .github/
│ └── workflows/ # CI/CD pipelines (Auto-update README)
├── solutions/ # Source code organized by difficulty
│ ├── easy/
│ │ ├── README.md # 🟢 Auto-generated Easy table
│ │ └── ...
│ ├── medium/
│ │ ├── README.md # 🟡 Auto-generated Medium table
│ │ └── ...
│ └── hard/
│ ├── README.md # 🔴 Auto-generated Hard table
│ └── ...
├── update_readme.py # Automation scripts
└── README.md # Automatically updated index & stats
© 2026 Giovanni Zanotti. All Rights Reserved.