AOC 2022 Day Eight

[danieltott]

Discussion of solutions for Advent of Code Day 8 here.

Don't forget about the VC Advent of Code private leaderboard:

• Go to leaderboard/private
• Use join code 363496-e6f42283

[danieltott]

NO FANCY! HULK HATE FANCY! ONLY FOR LOOPS!

https://github.com/danieltott/aoc2022/blob/main/src/day08/index.ts

[rhdeck]

You wouldn't like me when I'm fancy (Stable Diffusion take on this)

[doleraj]

It is fascinating that you beat the absolute pants off my solution for runtime, even with the less-fancy option for solving it. I suppose that makes sense given that I've got O(n^diggity-boo) going on with mine.

[rhdeck]

Zip and list comprehension again to my rescue. https://github.com/rhdeck/aoc-2022/blob/main/src/8/day_8.ipynb

[tkshill]

Perfectly functional, as all comprehensions should be

[doleraj]

Slightly more fancy than for loops, but only just barely: https://github.com/doleraj/adventofcode/blob/main/aoc2022/src/day08/index.ts

plz no smash

[tkshill]

No hulk smash here. Just slicing and dicing!

[tkshill]

Functions and some scripts and silly mistakes. I'm satisfied. Mainly because I think I made full use of the standard libraries.

solver here

edit: wrote my only converter from seq to 2d array just to discover one already existed. So there's still a lot I need to learn from the standard library.