Sharing my solutions for Advent of Code 2020, this one describes the method/libraries I've used.
- More recursion, however this time I manged to do it correctly.
- I had missed one minor deatil about how many cards that went into the recursive rounds.......
- Looping through structures and eliminating one by one...
- Puzzles and Jigsaws are fun - however it's easy to make this one overcomplicated - numpy is probably not the best way to solve it either.
- Started with calculating all kinds of stuff, before I realised I could just make a version of every single tile (flipped/rotated) and make sure that top is in connected to bottom etc.
- And only one tile matched pr place....
- Recursive functions again - this one caused lots of frustration!
- Calculator! Checking texts...
- Using numpy array was smart when we extended the number of dimensions...
- Simple fields, loops and validations
- List and dict
- Binaries are okay, but memory-terms (address, bits, masks etc) are confusing!
- Found a simple solution, after trying heaps of slow loops
- Simple structures, however manual approach
- Back to numpy arrays again to manipulate structure
- Tricky one - tried generating all solutions, but was too slow.
- Tried again with recursive functions, also too slow
- Added caching and it was quick
- Simple lists/enumerate
- Functions!
- Recursive functions
- Sets, lists and loops
- Simple lists/dicts/loops
- More Regex
- Used numpy arrays for the first time
- Regex it is
- Looping through lists