commit ad61c117c7068b8ad766709c8db29397c794882e
parent dd92cf0f8f1931a0e1d5af4203fffd02efec3cd5
Author: Eamon Caddigan <eamon.caddigan@gmail.com>
Date: Wed, 8 Dec 2021 20:38:00 -0500
Forgot to update this part of the comment
Diffstat:
1 file changed, 1 insertion(+), 10 deletions(-)
diff --git a/day08_part2.py b/day08_part2.py
@@ -22,16 +22,7 @@ seven-segment displays"""
# * If 5 segments are lit and it is missing only one of the segments from '6',
# that's '5'
# * If 5 segments are lit and it's not a '2' or a '3', that's '2'
-# So right now in part 1, it's possible to find the four digits displayed for
-# each line of puzzle input! But...
-# I'm not going to implement it yet, because "good programmers are lazy", and
-# maybe part 2 will throw me for a loop? Regardless, figuring this out has
-# influenced my decision about how to represent the data; e.g., we're doing a
-# lot of set operations, so I'm going to use sets for everything, and since
-# it's easy to imagine wanting to use these sets of lit segments as dictionary
-# keys, we'll use immutable `frozenset`s specifically (which can be `dict`
-# keys).
-
+# It's part 2, so apparently we're doing it!
from day08_part1 import (EXAMPLE_INPUT,
convert_input_to_df,
