A collection of my solutions to Project Euler problems, solved completely from scratch in Python.
This repository contains my personal solutions to Project Euler problems. Each solution has been developed independently, implementing all necessary algorithms without using pre-computed data or pre-generated lists (such as prime numbers, factorials, or mathematical constants).
All solutions are optimized to run in reasonable time, following the "few seconds rule". The code focuses on algorithmic implementation rather than detailed explanations.