Project Euler

---

Progress

Problems	Completion	Level	Mean	Highest	Rank	Language	Country
252 / 1010	25%	10 · Dodecahedron	7.02	39	#1060	Python	India

View solutions on GitHub →

---

Problems solved by difficulty level

---

Solving activity

---

Favourite ones problems

The repository contains my Python solutions and experiments for the problems I've solved.

A few of the more interesting recent ones include:

• 252 — Convex Holes — computational geometry and convex hull reasoning.
• 328 — Lowest-cost Search — dynamic programming and optimization.
• 485 — Maximum Number of Divisors — divisor-counting and sliding-window techniques.
• 262 — Mountain Range — computational geometry and path finding.
• 460 — An Ant on the Move — optimization and geometric reasoning.
• 265 — Binary Circles — combinatorial enumeration.
• 101 — Optimum Polynomial — polynomial interpolation and finite differences.

The solutions aren't intended to be a polished algorithm library. They're a record of how I approached problems: experiments, failed ideas, optimizations, and eventually working solutions.

→ Browse the Project Euler repository

---

Stats