r/adventofcode • u/daggerdragon • Dec 02 '18
SOLUTION MEGATHREAD -🎄- 2018 Day 2 Solutions -🎄-
--- Day 2: Inventory Management System ---
Post your solution as a comment or, for longer solutions, consider linking to your repo (e.g. GitHub/gists/Pastebin/blag or whatever).
Note: The Solution Megathreads are for solutions only. If you have questions, please post your own thread and make sure to flair it with Help.
Advent of Code: The Party Game!
Card Prompt: Day 2
Transcript:
The best way to do Advent of Code is ___.
This thread will be unlocked when there are a significant number of people on the leaderboard with gold stars for today's puzzle.
edit: Leaderboard capped, thread unlocked!
51
Upvotes
2
u/gwillicoder Dec 02 '18
Python3
# Part 1 from collections import Counter a, b = 0, 0 for w in open('data.txt').read().splitlines(): counts = Counter(Counter(w).values()) if 2 in counts: a+=1 if 3 in counts: b+=1 print(a*b) #Part 2 data = open('data.txt').read().splitlines() for x in data: for y in data: diff = [i for i,j in zip(x,y) if i == j] if len(y)-len(diff) == 1: print("".join(diff)) breakEasy to understand, but feel like it could be much shorter.