Go to file
Parnic aaf31ed7b1 Shave a few ms off day 14
This is a small low-hanging fruit pass. I was really just curious where the time was going since I didn't feel like the algorithm was actually expensive. Turns out it's not, really...the larger cost is setting up the frequencies and pairs collections, and computing min/max was 9x more expensive than it needed to be (I was expecting 2x since I was iterating over the collection twice, but 9x is...unreasonable, so I just unrolled it myself). It also turns out that MinBy() is marginally slower than Min() with no gain (for this use case), so that was an easy win on the brute force solution.
2021-12-14 12:51:50 -06:00
2021-12-05 11:19:10 -06:00
2021-12-14 12:01:35 -06:00
2021-12-14 12:51:50 -06:00
2021-12-10 13:46:41 -06:00
2021-12-02 10:03:00 -06:00
2021-12-01 08:00:40 -06:00
2021-12-01 08:00:40 -06:00
2021-12-10 13:46:41 -06:00
2021-12-10 13:46:41 -06:00
2021-12-01 08:03:21 -06:00

Advent of Code 2021

My solutions to Advent of Code 2021.

Description
No description provided
Readme 366 KiB
Languages
C# 94.8%
JavaScript 3.1%
Rust 1.2%
Go 0.9%