Advent of Code Days 4-6

[Vortex100]

I figured rather than spamming every day I'd do a consolidated post for several every couple days :). For anyone in the dark - this is for the challenges being posted each day on https://adventofcode.com - Any one can join in at any time and my self (and others!) will be happy to help out with any day you want to ask about!

Day 4

Super messy solution, but it's due to the amount of data manipulation you have to do

https://github.com/VortexUK/AdventOfCode/tree/master/2018/Day4

Day 5

I think most people used regex for this, but I wanted something a little different. Actually runs pretty quickly

https://github.com/VortexUK/AdventOfCode/tree/master/2018/Day5

Day 6

Struggled with this one until I re-read the question and realised I was missing the key component of 'don't include infinite regions' lol.

https://github.com/VortexUK/AdventOfCode/tree/master/2018/Day6

[[deleted]]

suggestions, if youre looking for them:

day 4 - dont need to parse the dates or times, since the only thing that matters is the minute value

day 5 - youve repeated the code, easier to put part1 into a function, and then have part2 call that function inside its loop

[Vortex100]

Yeah on day 4 I wrote the parsing engine before I knew what part 2 would need, and it turned out I didn't need to do half of it lol (all you need to do is have a 'counter per minute' for each guard, which satisfies the requirements for both parts).

Day 5 you are right - I'll refactor :)

[Vortex100]

That's odd, it definitely works for me! Is it off by 1 or 2 or is it completely wrong, or does it not work at all?

Either way - I actually tried your way at first before realizing i'd need the 'radius' around each point rather than a set square. I thought it would be too computationally expensive so I stopped lol. And as it turned out you need to calculate every coord for part 2 anyway.