bjorng
Advent of Code 2019 - Day 20
Note: This topic is to talk about Day 20 of the Advent of Code 2019.
There is a private leaderboard for elixirforum members. You can join it by following this link and entering the following code:
39276-eeb74f9a
Trending in Challenges
Other Trending Topics
Latest on Elixir Forum
Sponsor Spotlight
Producing high quality Elixir screencasts since 2017.
Categories:
Sub Categories:
Forums
Popular Tags
- #ecto
- #liveview
- #troubleshooting
- #learning-elixir
- #deployment
- #library
- #erlang
- #testing
- #genserver
- #mix
- #absinthe
- #remote-other
- #otp
- #plug
- #how-to-question
- #macros
- #postgres
- #channels
- #elixirconf
- #exunit
- #discussion
- #code-sync
- #javascript
- #podcasts
- #onsite
- #dialyzer
- #docker
- #authentication
- #umbrella
- #full-time-contract
- #podcasts-by-brainlid
- #ecto-query
- #elixir-ls
- #phoenix_html
- #iex
- #blog-post
- #graphql
- #genstage
- #ai
- #elixirconf-us
- #websockets
- #supervisor
- #advent-of-code
- #distillery
- #processes
- #api
- #forms
- #metaprogramming
- #performance
- #security
Our Sponsors
Build Elixir applications with speed and confidence.
Supporting innovation across the BEAM ecosystem.
We build reliable cloud platforms for business-critical systems.
Catch errors, track performance, monitor hosts and more.
Error tracking, logs, uptime, and Just Enough APM. Built for developers.
Producing high quality Elixir screencasts since 2017.
Enabling companies to succeed by building software people love.
The deployment platform built for Elixir: PaaS ease, VPS control.
The team behind Membrane, Popcorn, LiveDebugger. Available for hire.
Courses that'll move you from confusion to "Aha, now I get it!"
First Post!
bjorng
This was a fun one! Here is my solution.
Most Liked
sasajuric
I found today a bit finicky. Here’s my solution. Takes about 2 seconds for part 2.
ferd
Nah, I believe I was careful with label order. I’ve been looking at found an issue with my labels and skipping, which I fixed to work the first example, but now fails the second…
I’ve ended up doing the second example by hand (twice!), and agreed with my code in a way that disagreed with their map. I then put my input for part 1 in the box and it passed.
So the way I counted things didn’t match the second example that can reach AA → ZZ in 58 steps, it did it in 59, same as my code. I’m still not too sure what was going on, but I’ll try the rest later for part 2.
Last Post!
ferd
Finally found the time to finish it. It works fine but most of my issues required a huge huge amount of time to debug because I expected them to be with the procedural parts of the BFS and turned out to be minor errors or inconsistencies across the formatting of input maps that turned out to create wildly different behaviours across runs.
It’s almost 3 hours long; I post the video for completeness, not because anyone should lose that much time watching it.