~jpgleeson/adventofcode2020

d64fd35c — jpgleeson 4 years ago master
Day 13 - Part 1

Very straightforward. Glad I know the modulo operation.
ab79b514 — jpgleeson 4 years ago
Day 12 - Part 2 Incomplete.

I believe the transformations are correct, but it's not giving me the correct answer.
8f115d39 — jpgleeson 4 years ago
Day 12 - Part 1

Straightforward enough.
7c1fba42 — jpgleeson 4 years ago
Day 11 - Part 2 Incomplete

Banging me head against a wall trying to figure out why it's not passing the correct values when I can see them being correct in the debugger. Will take a break and come back to it.
6767a173 — jpgleeson 4 years ago
Day 11 - Part 1

This is sloooooowwwww, but correct. Had a stupid issue where I wasn't checking if locations were seats before checking for occupied which gave me various off by a few errors.
73ef8bd8 — jpgleeson 4 years ago
Day 10 - Part 2

Yes, recursion doesn't work. Left it running for about 20 minutes and was getting nowhere. Eventually came up with this, ran into a stupid issue where I was multiplying each permutation count at the end, so had to look for some tips online.
9192988d — jpgleeson 4 years ago
Day 10 - Part 1

Straightforward.
852bac2a — jpgleeson 4 years ago
Day 9 - Part 2

This works. It seems slower than the last one, but it's correct, so what can you do.
c26b5efa — jpgleeson 4 years ago
Day 9 - Part 2 INCOMPLETE

This works on the sample data but not with the full input. Unclear what's going on. Trying another approach.
1e55d954 — jpgleeson 4 years ago
Day 9 - Part 1

Just learned about the sliding windows algorithm. I believe I've implemented it here, but maybe not.
84d5f1f3 — jpgleeson 4 years ago
Day 8 - Part 2

Some minor issues where when rebuilding the modified instructions the new instruction wasn't being copied in properly, but correct now.
8c137812 — jpgleeson 4 years ago
Day 8 - Part 1

Easy. Enjoyable.
96b99103 — jpgleeson 4 years ago
Day 7 - Part 2

Struggled with this for a bit until stopping to think about what was going on. Kept multiplying by zero in the recursive count by mistake.
53957aee — jpgleeson 4 years ago
Day 7 - Part 1

Recursion based. Ran into a bunch of dead ends before figuring it out.
29d00df3 — jpgleeson 4 years ago
Day 6 - Part 2

Some refactoring of how I take in the data to make this work. Keeping each person in group on separate lines instead of merging into one easier to parse line. I liked this.
ac4d51a9 — jpgleeson 4 years ago
Day 6 - Part 1

Using Linq for the distinct method rather than implementing it in a for loop.
ecc50f4e — jpgleeson 4 years ago
Day 5 - Part 2

Odd way of getting to the solution where I find the ones on either side. Not sure if there's a more elegant way of doing this.
b683b3ef — jpgleeson 4 years ago
Day 5 - Part 1

Not the most elegant. But it works.
81e08c25 — jpgleeson 4 years ago
Day 4 - Part 2

Imagine doing this without RegEx.
d3a904e9 — jpgleeson 4 years ago
Day 4 - Part 1

If else statement is a bit long. Case is probably a better structure for it. But this does work and is fast.
Next
Do not follow this link