CodingExercises VS advent-of-code

NB: The average durations are calculated using utility methods in lib.rs

GitHub - Part 1 and 2

Part 1 - 72µs, excluding I/O

For reference, here's my rather verbose solution.

Python - 9 LOC. Quite a pleasing solution...

Rust - 101 LOC (excluding unit tests).

Rust - 36 LOC, excluding unit tests. The code seems quite neat to me.

Rust: part 1, part 2 Python: part 1, part 2

Here's how I do it: https://github.com/AndrewTweddle/CodingExercises/blob/master/project_euler/src/bin/problem36_loop_over_3_digits.rs

Part 1 (Rust) - pretty simple.

[LANGUAGE: Python 3] 153/75 Raw solution

One could instead count |F7 (that's what I do in my refactored solution), but counting all the bends would miscount the vertical segments (FJ would end up canceling itself out).

That sounds like what I suggested here, actually. I don't have anything in my library with quite the right API yet, but I already have most of what you describe coded out. (It looks like I whipped it up for 2017 Day 13.)

[LANGUAGE: Python 3] Embarrassing/Embarrassing Ugly raw solution code

[LANGUAGE: Python 3] 66/101 Raw solution code

Python 3 21/12

It doesn't, but you can use a separate list, wrapper classes, and deque.index to find where the values live. I may be biased but I think that my solution (ultimately using deque) isn't as complex as a custom linked list.

Part 2 assumes you did part 1 properly. I did not! I'm pretty sure that the intended solution is to do a sort of reverse search (have a target number of geodes and work backwards to see if that's possible to achieve) but I was just not having success coming up with a way to do that. It's probably going to be blindingly obvious once I figure it out, but that might be an exercise for tomorrow.

Python 3 9/15!!!

Python 3 44/45