finished day25!

README.md

@@ -31,3 +31,4 @@ Day | Name | Type of Algo & Notes
 22 | Slam Shuffle | - Seems fairly easy at first... But the part 2 has numbers somewhere in the 32-bit number to 64-bit number range... So the part 1 code is pretty much useless... <br> I gave up on part 2. It's some crazy __linear algebra with modular inverses?..__ Theoretically it makes some sense.. but I had to read someone else's solution for hours to kind of understand the implementation...
 23 | Category Six | Intcode computer NETWORK of 50 computers... <br> Oof that's a lot of stuff to coordinate, but not too hard, make a Network struct. <br> Part2 doesn't seem too different, but includes a NAT device, which is simple enough to just store in variables in the goroutine... <br> That has to be record time for me to finish a day :) Sigh of relief after day22.
 24 | Planet of Discord | Almost done... When the input if 25 character you know it's going to be a crazy AoC day... <br> Part1 is fairly straightforward _2D slice traversal_. <br> Part2 makes it a recursive map... of course <br> I chose to utilize predefined-length arrays to minimize having to make lots of slices. If the number of minutes was not known ahead of time, then a doubly linked list could have worked to expand layers indefinitely. Or a map with int-indexes because those could be negative. <br> I wrote a lot of code to just handle recursive structures... There's probably a way to clean this up and I definitely didn't plan my approach well enough before writing code
+25 | Cryostasis | One final Intcode problem <br>