I’m continuing to write really ugly Gleam code - but it works so far 
michallepicki
qhwa
Thanks for sharing! Watching the entire progress is such enjoyment and I learned a lot from the video. There were several times I stop and check the things I didn’t know before. And the way you debug is even more worthy to watch. Please share more when available! 
2
evantravers
My solution is here… adventofcode/2019/elixir/lib/day02 at master · evantravers/adventofcode · GitHub
I’m sure my computer code looks really similar to everyone else’s, but I was really pleased with breaking out of the comprehension using the throw catch syntax:
def p2(input) do
try do
for noun <- 0..99, verb <- 0..99 do
result =
input
|> Map.put(1, noun)
|> Map.put(2, verb)
|> Intcode.run
if result == 19690720 do
throw({:break, (100 * noun + verb)})
end
end
catch
{:break, result} -> result
end
end
0
agundy
Not sure my solution is idomatic but it works pretty well and I had fun writing it. Any tips?
defmodule Solutions.Day2 do
@opcode_add 1
@opcode_multiply 2
def execute_intcode(ints, pos_ptr \\ 0) do
# take 4, [operator, first value, second value, save register]
case Enum.slice(ints, pos_ptr, 4) do
[@opcode_add, first, second, register] ->
result = Enum.fetch!(ints, first) + Enum.fetch!(ints, second)
execute_intcode(List.replace_at(ints, register, result), pos_ptr + 4)
[@opcode_multiply, first, second, register] ->
result = Enum.fetch!(ints, first) * Enum.fetch!(ints, second)
execute_intcode(List.replace_at(ints, register, result), pos_ptr + 4)
[99 | _] ->
ints
end
end
def patch_intcode(ints, pos_one, pos_two) do
ints
|> List.replace_at(1, pos_one)
|> List.replace_at(2, pos_two)
end
def result(intcode, pos_one, pos_two) do
[result | _] =
intcode
|> patch_intcode(pos_one, pos_two)
|> execute_intcode
result
end
def part_1(intcode) do
result(intcode, 12, 2)
end
def part_2(intcode) do
answer = []
valid_inputs = for noun <- 0..99,
verb <- 0..99,
result(intcode, noun, verb) == 19690720,
do: {noun, verb}
{noun, verb} = hd valid_inputs
100 * noun + verb
end
def answer(input) do
list = String.split(input, ",")
int_list =
Enum.map(
list,
fn el -> String.to_integer(el) end
)
IO.puts(part_1(int_list))
IO.puts(part_2(int_list))
end
def answer do
contents = File.read!("priv/day_2_input.txt")
answer(String.trim(contents))
end
end
0
patrickcarver
ganesh
factoryd
My solution here: https://github.com/trbngr/advent_of_code/blob/master/lib/advent_of_code/2019/day02.ex
I’m really surprised that I seem to be one of the few people that used structs by following the directions pretty dang literally. lol
I’m sure my use of List functions slow this down quite a bit. But I spent way more time that I had planned to and I’m spent.
0
ColaCheng
The part2 solution that I use rand.uniform/1 to generate the candidate pairs.
0
lpil
Creator of Gleam
I’m somewhat late to the party, but here’s one in Gleam!
https://github.com/lpil/advent-of-code/blob/master/2019/02nd-part-1/src/advent.gleam
https://github.com/lpil/advent-of-code/blob/master/2019/02nd-part-2/src/advent.gleam
1
dimitarvp
Very late myself, here’s mine: https://github.com/dimitarvp/aoc2019.ex/blob/master/lib/day2.ex
Rather naive solution using the for comprehension with a filter for part two, finishes in ~85ms (milliseconds).
Figured it was slow and added another version with binary search which finishes in ~750us (microseconds), a ~113 times improvement.
Pretty happy with the result, would welcome criticism!
EDIT: DISCLAIMER: Borrowed the pretty neat short variable names from @bjorng’s solution. I liked them a lot and used them. 
1