Saving Christmas Using Scala
summary
Walks through concrete Advent of Code solutions using Scala: parses inputs with pattern matching, uses sliding windows to count increases, prefers Vector for constant-time index/append, and limits probe-velocity search to ~500 candidates to find the max height for day 17. Implements recursive state simulation for velocities, computes register value per cycle to render a 40x6 (240-pixel) display, converts SNAFU base-5 numbers back and forth, and shows these short programs produce correct, fast results while highlighting common pitfalls.
AI-written summary · about
chapters (12)
- 0:00Introduction
- 2:25Advent of Code setup
- 4:12Day 1 depth puzzle
- 8:15Scala collections efficiency
- 10:01Day 17 trajectory modeling
- 18:41Day 3 compartment priorities
- 23:05Day 10 CPU simulation
- 29:17Day 10 CRT rendering
- 32:06Day 25 SNAFU conversion
- 36:29Advent of Code pitfalls
- 39:41Scala problem-solving benefits
- 40:48Encouragement and resources
related talks
29mPuzzles and Problem Solving with Scala Tooling.
34mSystematic Software with Scala
37mIntro to FP in Scala: Exploring a Toolbox for Solving Problems - Part 6 of 6
48mTechniques for Teaching Scala
01h 00mIntro to FP in Scala: Exploring a Toolbox for Solving Problems - Part 1 of 6
22mAdopting Scala: The Next Steps
40mADTs For The Win!
01h 03mIntro to FP in Scala: Exploring a Toolbox for Solving Problems - Part 4 of 6