Here are a few notes breaking down how I approached each problem. I’m mainly sharing these to document my thought process and the logic behind the code.

I am forcing myself to solve the problems in ascending ID order now, so I won’t just fool around with easy problems and trying things here and there without diving deeper.

solved: 471 / 993 | at: #244
Project Euler badge

  • 993cellular automation · turning machine · linear recurrence

    ( 67th) 2026-04-19

  • 242bit-DP · parity · popcount

    2026-04-24

  • 239inclusion–exclusion principle

    2026-04-07

  • 237matrix exponentiation · linear recurrence

    2026-03-28

  • 233number theory · Jacobi's two-square theorem

    2026-03-26

  • 228geometry · Minkowski sum

    2026-03-17

  • 227probability · expected value · Gaussian elimination

    2026-03-15

  • 224number theory · Barning's matrices · Pythagorean triples

    2026-03-14

  • 223number theory · Pythagorean triples · divisor enumeration

    2026-03-12

  • 222geometry · circle packing · optimization

    2026-03-11

  • 219greedy · prefix-free codes · priority queue

    2026-03-10

  • 210geometry · counting · Thales' theorem

    2026-03-10

  • 199geometry · Descartes' theorem · Apollonian gasket

    2026-03-08

  • 198number theory · Stern-Brocot tree · fractions

    2026-03-07

  • 195geometry · Eisenstein triples

    2026-03-05

  • 194combinatorics · chromatic polynomial · graph theory

    2026-03-03

  • 189combinatorics · dynamic programming · graph coloring

    2026-03-02