Day03 Tokens, Enums and Docstrings
A better way to communicate code
The Day 03 challenge involves the calculating whether a character symbol is adjacent to a part number in a two dimensional map, such as:
467..114.. ...*...... ..35..633. ......#... 617*...... .....+.58. ..592..... ......755. ...$.*.... .664.598.. and then doing things with the part numbers.
To calculate whether a symbol is adjacent to a part number we’re going to need:
the position of each symbol, the position of each number, the length of the token for each number.
[Read More]