Advent of Code 2019 - Day 3

bjorng

Erlang Core Team

Note: This topic is to talk about Day 3 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

29 comments

#2019 #advent-of-code

1 3252 29

2019-12-08 19:59:10 UTC

Showing Posts 1 to 10

Show Best Posts
Show All (oldest first)
Show All (newest first)

bjorng

Erlang Core Team

Here is my solution.

Post #1

sasajuric

Author of Elixir In Action

Today was a bit finicky. Here’s my take.

Post #2

xfix

That was weird to do functionally. lib/day3.ex · master · Konrad Borowski / advent_of_code_2019 · GitLab

Post #3

NobbZ

Todays solution is a bit earlier as usual for me, as I currently can’t do office work as we have an internet outage. Doing this per mobile connection sharing right now.

Solution is at github, as usual.

gitlab.com/NobbZ/aoc_ex

lib/y2019/d3.ex

master

defmodule AocEx.Y2019.D3 do
  use AocEx.Boilerplate,
    transform: fn raw ->
      raw
      |> String.split()
      |> Enum.map(fn line ->
        line
        |> String.split(",")
        |> Enum.map(fn
          "U" <> num -> {:up, String.to_integer(num)}
          "R" <> num -> {:right, String.to_integer(num)}
          "D" <> num -> {:down, String.to_integer(num)}
          "L" <> num -> {:left, String.to_integer(num)}
        end)
      end)
    end

  def part1(input \\ processed()) do
    [wire1, wire2] =
      input

This file has been truncated. show original

Implementation is pretty straight forward after one has realised that we are basically just dealing with 2 sets and we want to know where they intersect

Though code clean up has to wait, as I have to attend to a meeting in a couple of minutes, which we will hold as scheduled despite the internet problem.

Post #4

cblavier

I have a bug I can’t figure out, please help ^^

It works fine on simple tests, but when running on full puzzle input, it gives me a wrong shortest distance (=1). It also gives me the good answer but only in second rank

Post #5

cblavier

Ok finally found it : I had a bug in inc_pos_x / inc_pos_y when dealing with negative distances

Here is my final solution by the way

Post #6

egze

Very elegant!

Post #7

Schumi2k10

Hi,
at the moment so try to learn Elixir. So I will solve the advent of code for better understanding of Elixir.
Currently I only solved Day 1 and 2. I hope I find some time this week to solve the next days
Here is a link to the repo: repo.

I’d appreciate your feedback.

Post #8

NobbZ

Could you walk us through your implementations in the appropriate days thread?

I only glanced, and they look as if they only provide a single solution each, rather than tackling both problems of the given day.

Post #9

Schumi2k10

Sure, I overlooked that this thread is only for the third day.
And then I’ll adjust the solutions again so that both solutions are there and not just the second solution.

Post #10

Load more posts (19 remaining)