About

The quest to save Christmas in the Advent of Code coding challenge continues!

This canvas solves Advent of Code Day 3, a two-part battery bank joltage calculation problem: Part 1 finds the maximum 2-digit joltage by selecting any two digits in sequential order from each battery bank string and sums them (answer: 17,207), while Part 2 finds the maximum 12-digit joltage using a greedy selection algorithm that maintains digit order to maximize the resulting value . The workflow demonstrates algorithm development, debugging, test validation, and large-scale puzzle solving with 200 battery banks processed through both approaches.