★ Python Walkthroughs & Tooling

Dazbo's Advent of Code

Using Advent of Code to sharpen idiomatic Python — testing algorithms, exploring libraries, and sharing practical, step-by-step walkthroughs.

Midnight AoC glowing circuit constellation tree crowned with a gold Advent star

Browse Solutions by Year

From 2015–2024, Advent of Code ran 25 days (50 ★); from 2025 onwards, it runs a focused 12 days (24 ★). Choose standalone Python scripts + walkthroughs or all-in-one Google Colab notebooks below.

The Python Journey

Whenever a puzzle relies on a technique worth keeping in your toolkit — Dijkstra’s algorithm, itertools combinatorics, regex extraction, or 2D grid coordinates — my day walkthroughs link straight into a standalone chapter of The Python Journey. You can work through them as a curriculum or jump directly to the topic you need:

Getting Started with Python

Set up Python, Visual Studio Code, virtual environments, and clean development habits from scratch.

Reusable Code (aoc_common)

Shared Point, Grid, and Vectors abstractions, binary search, interval merging, and puzzle validation.

Shortest Paths — BFS, Dijkstra & A*

Navigate unweighted mazes, weighted cost maps, and heuristic search spaces without reinventing the queue.

Graphs & NetworkX

Model dependency trees, connected components, cycles, and visual network diagrams cleanly.

Permutations, Sets & Comprehensions

Expressive itertools pipelines, set algebra, and generator expressions built for puzzle speed.

Symbolic Maths (SymPy) & Plots

Solve linear equations and trajectory intersections algebraically, and debug spatial grids with Matplotlib.

Jupyter Notebooks & Colab

Combine executable Python cells, rich telemetry, and narrative notes interactively in the browser.

Encrypting Inputs (git-crypt)

Respect AoC's input-sharing rules in a public repository using transparent git-crypt encryption.

Caching & Dynamic Programming

Collapse exponential search trees into millisecond lookup tables with @cache, bitmask states, and branch-and-bound pruning.

Intervals, Cycles & Grid Geometry

Push massive [lo, hi) ranges through pipelines, fast-forward 1012-step loops, and measure polygons with Shoelace and Pick's Theorem.

Constraint Solving & Integer MILP

Solve exact 2×2 linear systems via Cramer's rule and under-determined integer puzzles with scipy.optimize.milp.

Virtual Machines & Sparse Automata

Decompile assembly loops, diagnose ripple-carry adders, and evolve N-dimensional sparse grids with Counter convolutions.

Browse all 48 reference guides on the Python Journey index.

What is Advent of Code?

Created by Eric Wastl every December since 2015, Advent of Code releases a fresh two-part programming puzzle each day. Part 1 introduces the scenario cleanly; Part 2 usually turns up the scale — forcing you to replace brute-force nested loops with sets, caching, modular arithmetic, or graph search. You can write solutions in any language, run them in any environment, and revisit every past event at any time of year.

If you’d like to run my solutions locally against their built-in sample inputs right away (without needing an AoC cookie or decryption key), clone derailed-dash/Advent-of-Code, install the environment with uv, and use the bundled aoc CLI:

git clone https://github.com/derailed-dash/Advent-of-Code.git
cd Advent-of-Code
make install           # hydrates Python 3.13+ virtualenv via uv sync
uv run aoc list        # inspect solved years, progress, and script/notebook formats
uv run aoc run 2025 1 -s

Every walkthrough page here maps directly back to the runnable files under src/.

More From Dazbo

Away from December puzzles, I write about Python tooling, AI engineering, cloud architecture, and pragmatism in delivery across my personal site and developer blogs:

If you’d like to dive straight into some of my longer-form Medium writing:

Coding, Python & Generative AI 8 articles
Google Cloud, Terraform & Enterprise Architecture 12 articles