Interesting, I'll have to look at that. Actual algorithms are a big weak point for me, I'm not a developer by day, so I don't spend a lot of time learning code

Interesting, I'll have to look at that. Actual algorithms are a big weak point for me, I'm not a developer by day, so I don't spend a lot of time learning code practices or computer science/math topics. This was my solution to Day 7 Part 2 (positions = sorted int list of input data): def calculate_fuel(positions): fuel = None low_fuel_value = None calculated = dict() for value in range(positions[0], positions[-1]+1): consumed = 0 for position in positions: diff = abs(value - position) try: consumed += calculated[diff] except KeyError: if position != value: consumption = sum([x for x in range(1,diff+1)]) calculated[diff] = consumption consumed += consumption if fuel: if consumed < fuel: fuel = consumed low_fuel_value = value else: fuel = consumed low_fuel_value = value print(f"Aligning to: {low_fuel_value}") return fuel And Day 6 I fell for the bruteforce bait and had the thought "It can't be as easy as changing 80 to 256, right?". Then I realized the pain I had created for myself. BUT! My 6p2 code ran faster than my 6p1 by a good margin, which I was happy about.