What did you think of Day 3? Looks like we had similar approaches, though I did spend a fair amount of time considering the algorithm for calculating the overlapping area between two claims directly.
-
-
-
Basically my approach to AoC is to find the simplest solution that works in a reasonable time. If I ruminate too much, I won't have time to do all the puzzles. :-) But yeah, I briefly thought about smart ways to do the overlap, and the realized that brute forcing would be simple.
End of conversation
New conversation -
-
-
Do you like Sushi? :)
-
I do not actually!
- 1 more reply
New conversation -
-
-
Your approach to day4 was a tad wordier than mine but seems to have been similar. I'm trying to do your thing of not panic!()ing etc. It has been instructive in error propagation for me :-D https://git.gitano.org.uk/personal/dsilvers/aoc.git/tree/2018/src/bin/day4.rs … if you're interested :-)
-
Nice! But yeah, I'm really not happy at all with my day 4 answer. I think the code could be much clearer than what I wrote. But yeah, this is a really excellent opportunity to get some error handling experience. :-)
- 10 more replies
New conversation -
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.