Advent_of_Code VS aoc-2020

This made me think about how to make my own Python solution more elegant. It was one of the earlier things I wrote in Python, and I've done almost every AoC year since! I've refactored it and switched to using complex numbers, I think it turned out pretty well. Here's the code for both parts.

Here's my own solution, if you're interested: https://github.com/Nomen-Heroum/Advent_of_Code/blob/master/2020/day20.py

On a vaguely related note, I decided to finally commit my solutions to GitHub! Here is my day 20 solution, cleaned up and commented to death for your reading convenience.

Mine went down from 20062 to 16881 recursive calls, here's my code (also Python 3). Just add a global CALLS before line 7 and global CALLS; CALLS += 1 before line 17 in the if block to count the function calls.

C++ part2 215ms on my laptop

Get the repository, then you can use cmake to build it like I do, or just use command line. If you want to test it with circular_buffer, you'll need boost, too!

C++ part1 part2

C++ part2 - less than 2ms on my laptop. Took forever to write. Lots of missteps. And room for improvement!