# AoC 2018 Day 6: Infinite Area Simulator

### Source: Chronal Coordinates

Part 1:Given a list of points, calculate the region of points closest to each point (using Manhattan distance). Return the size of the largest non-infinite region.

Part 1:Given a list of points, calculate the region of points closest to each point (using Manhattan distance). Return the size of the largest non-infinite region.

Part 1:Given a string, reduce it by removing pairs of letters that are the same letter but different cases. Repeat until you have a minimal string.

Well. That is certainly a book.

It basically reads like Mira Grant thought: you know what’s kind of creepy but doesn’t really have that many books written about them? Mermaids. And just went with it. It works though. Creepy as heck at times and once things start happening around halfway through the book, they really don’t stop. The ending is a bit weak and leaves me wanting more answers, but not enough to ruin the entire book.

Part 1:Given a log of guard shifts and times asleep/awake, calculate the guard that was asleep most often and which minute they were most asleep for.

Part 1:Given a list of overlapping regions defined by (left, top, width, height) count how many integer points occur in more than one region.

She came to a decision, pulled her feet out of the mire, and stepped carefully over the ring of bodies that were scattered around her. They were all motionless, and all of them were wearing latex gloves.

So far as openings go, that was certainly one to get my attention.

Part 1:Given a list of strings, count how many contain exactly two of a letter (`a`

) and how many contain exactly three of a letter (`b`

). Calculate`a*b`

.

Part 1:Given a list of numbers (positive and negative) calculate the sum.

Let’s do it again! I’m starting a day late, but much better than last year ðŸ˜„!

This time around, I’m hoping to solve each problem in both Python and Racket, both to show an example of how the languages differ and … well, because I can ðŸ˜‡.

*EDIT 2018-12-05*: Yeah… I’m not actually going to do these in both Racket and Python. The solutions are ending up being near direct translations. Since there are probably fewer people solving these in Racket, I’ll do that first and Python eventuallyâ„¢.

As always, these problems are wonderful to try to solve yourself. If you agree, *stop reading now*. This post isn’t going anywhere.

If you’d like to see the full form of any particular solution, you can do so on GitHub (including previous years and possibly some I haven’t written up yet): jpverkamp/advent-of-code

It started with an idea from an annotation on the Darths and Droids webcomic of all things:

A mysterious figure drops an overdue book in the library’s after-hours returns slot. Long overdue. 90 years overdue. It’s a book about the occult, and contains incantations and recipes for drastically extending life. The borrower’s last known address is that old “haunted” house on the hill outside town. Someone need to go investigate to recover the overdue fees…

Take a few hours outlining by hand (which I never used to do, but am starting to see the value of) and a month of crazy nights…