This Week's Trending Top

This Month's Trending Top

This Year's Trending Top

Last Three Year's Trending Top

New
bjorng
Here is my solution for day 1 of Advent of Code: defmodule Day01 do def part1(input) do all = parse(input) {first, second} = E...
New
igorb
Today is a brute-force day: advent-of-code-2024/lib/advent_of_code2024/day6.ex at main · ibarakaiev/advent-of-code-2024 · GitHub Takes a...
New
code-shoily
Here’s my day 3 code This was quite easy. I was afraid Part 2 would be “un-regex-able” and was preparing for hand crafting automata bu...
New
adamu
I said I was on a break, but I took a sneak peak and it looked fun so… Part 1 completes in half a millisecond with a single pass of the ...
New
New
Aetherus
Today’s problem is really tense. I don’t think I can do it without libgraph.
New
antoine-duchenet
Everything went smoothly today. Nothing to change to solve part 2 because I already used memoization for part 1 (it looked like an AoC e...
New
New
lud
Gosh this one took me sooo much time. At first I was trying to iterate each digit independently on the input A number to make digits cha...
New
lud
At first I was scared but I found is a simple way to compute the sides. defmodule AdventOfCode.Solutions.Y24.Day12 do alias AdventOfCo...
New
igorb
I found today a bit tedious: advent-of-code-2024/lib/advent_of_code2024/day15.ex at main · ibarakaiev/advent-of-code-2024 · GitHub.
New
liamcmitchell
A frustrating one for me. I spent a long time trying to understand why some combinations resulted in fewer presses and struggled to keep ...
New
New
rvnash
Anyone have a solution to Part 2 today? Part 1 was straight forward, but I can’t figure out a programatic way to do part 2. I understand ...
New

Trending Over Three Years Top

seeplusplus
This one was much easier for me than yesterday’s. Part 1 runs in 22ms and part 2 runs in ~3s. defmodule BridgeRepair do def parse_inpu...
New
bjorng
After getting the correct answer for both parts, I spent some time optimizing the execution time. Now the combined time for both parts is...
New
igorb
Today was a nice break from Day 21. Part 2 is just brute-force, with a bit of optimization tracking what sequences return how many banana...
New
New
igorb
This puzzle was a nice break after the difficult Day 17! . advent-of-code-2024/lib/advent_of_code2024/day18.ex at main · ibarakaiev/adven...
New
seeplusplus
This one wasn’t too bad :slight_smile: I actually ended up solving part 2 first, and had to work around it in part 1 to get the answer th...
New
lud
This one was scary at first. I loved how part one directs you into an obvious optimization, and then part 2 kicks your butt by asking to...
New
bjorng
This wraps up Advent of Code 2024 for me. Looking back on the puzzles, here are the ones I found to be the hardest: Day 11: Plutonian P...
New
liamcmitchell
I think I was clever by precalculating a search area to iterate over: Part 1 example (5.7ms): 0 Part 1 input (93.0ms): 1417 Part 2 exam...
New
bjorng
This was surprisingly easy. After a quick attempt to use digraph, I implemented by own straightforward algorithm to find the groups. To...
New
mwilsoncoding
Here are the solutions I came up with for today: Part 1: defmodule Day3.Part1 do def solve() do File.stream!("03/input.txt") ...
New
  • Follow
  • Join
  • Shape
the conversation

Latest on Elixir Forum

Elixir Forum

Similar Portals

    None added yet

We're in Beta

About us Mission Statement