Was really overthinking the resort in part 2 and then think I stumbled into some dumb luck while exploring the data.
a sorta-brute-force solution - almost like a sorting algorithm
Spoiler
Part 1:
- Split the string at each point - breaking it into a left; current and right
- join this to the rules table (which is a before and after value)
- if the offensive value appears in the left part, then this particular combination fails
- Roll this up by report ID
Part 2:
in a loop:
- swap the before and after values that broke a rule
- check using the part 1 macro
- process the ones that are still failing
Main Canvas:
- Split the string at each point - breaking it into a left; current and right
- join this to the rules table (which is a before and after value)
- if the offensive value appears in the left part, then this particular combination fails
- Roll this up by report ID
Part 2:
in a loop:
- swap the before and after values that broke a rule
- check using the part 1 macro
- process the ones that are still failing
Main Canvas:
Checker:
Iterative Fixer:
Python code for Day 5:
All code at SeanAdams10/AdventOfCodePython: Advent of code challenges in Python - across multiple years
Part 1 was easy for me to understand. Part 2 not so much, but got through
Spoiler
This one is all about pattern recognition. Part one solved by matches and simple math. If the total number of matching rules equals the total number of combinations of numbers, then it's a match.
Part 2, we only look at the manuals that fail the first test. Then count the number of commas in each manual and divide by two. If the number of rules that apply to each manual equals half the number of commas, that's the number that will be in the middle.
Nothing unique to mine after looking at other solutions
Part 2, we only look at the manuals that fail the first test. Then count the number of commas in each manual and divide by two. If the number of rules that apply to each manual equals half the number of commas, that's the number that will be in the middle.
Nothing unique to mine after looking at other solutions
