Latest #2023 Threads Top

bjorng
I came up with a solution myself, but it is not fast. My first brute-force solution simply tried removing all combinations of three edg...
New
exists
After looking up the formula for calculating an intersection of two lines on wikipedia, part 1 was straightforward. I really do not know ...
New
lud
For part 2 I transformed the map into a graph because I wanted to see it and check if there was a bottleneck point or something. But no,...
New
bjorng
I went for a brute-force solution, implementing the most straight-forward algorithm I could think of. That initial implementation solved ...
New
igorb
So… that’s it? Everyone is stuck on part 2? :slight_smile: I looked at Reddit hints and thought I probably wouldn’t have come up with the...
New
lud
This one lost me at the beginning, but after a little inspection of the input, there is a clear path to the answer. Explainations in par...
New
lud
A rather verbose solution but simple enough I guess.
New
Aetherus
I confess that I asked ChatGPT about the math. It gave me a name of an algorithm called the Shoelace formula. I still have to pay attenti...
New
rugyoga
Fairly straightforward Dijkstra’s algorithm import AOC aoc 2023, 17 do def compute(input, candidates) do {{max_row, max_col}, ite...
New
igorb
For Part 1, I was lazy and didn’t want to maintain variables and pass them down to each function (which would also involve merging two di...
New

This Week's Trending Top

This Month's Trending Top

This Year's Trending Top

Last Three Year's Trending Top

adamu
Nobody’s doing Advent of Code this year? :smile: I might do the first week or so. For Day 1, first I solved it using regular expression...
New
christhekeele
Setting this down for the night, as after a quick naive solve for quick part 1 I realize that part 2 is by design computationally expensi...
New
Aetherus
The second part of today’s puzzle is very misleading. FYI, each of the ghosts has only one possible position that ends with a "Z" on its...
New
Aetherus
I tried to use combinatorial to solve today’s puzzles but failed (my brain burned out :exploding_head:). In the end I just used brute for...
New
Aetherus
I spent 3 hours struggling in part 2, until I noticed a very basic mistake :joy: Here’s my code: By the way, the starting position in...
New
christhekeele
Thought I’d kick today’s thread off! Parsing Enum rocks, so most of my code was actually in parsing input. ▶ Preprocessing input Part 1...
New
Aetherus
Don’t know why the regex ~r/[\W && [^\.]]/x does not work in Elixir. It works pretty well in Ruby. Anyway, here is my solution:
New
shritesh
I mapped both the cards and every possible hand to numeric values and sorted them. In part 2 I could only think of replacing the jokers w...
New
seeplusplus
Hello all, hopefully I post this before someone else does and I don’t dupe. IMO Day 4 was much easier than Day 3 (yay, I can sleep befor...
New
igorb
So… that’s it? Everyone is stuck on part 2? :slight_smile: I looked at Reddit hints and thought I probably wouldn’t have come up with the...
New
bjorng
My solution finishes both parts in 5 seconds on my computer. That time should be possible to reduce by optimizing my rather naive tilt/2 ...
New
shritesh
This was way too easy after the last few days. Simple map, filter and count.
New
rugyoga
Fairly straightforward Dijkstra’s algorithm import AOC aoc 2023, 17 do def compute(input, candidates) do {{max_row, max_col}, ite...
New
Aetherus
I confess that I asked ChatGPT about the math. It gave me a name of an algorithm called the Shoelace formula. I still have to pay attenti...
New
igorb
For Part 1, I was lazy and didn’t want to maintain variables and pass them down to each function (which would also involve merging two di...
New

Trending Over Three Years Top

CodeSync
Code BEAM Europe - the Erlang and Elixir Conference is an event built on the long-standing legacy of the Erlang User Conferences. An even...
New
lud
This one lost me at the beginning, but after a little inspection of the input, there is a clear path to the answer. Explainations in par...
New
New
lud
A rather verbose solution but simple enough I guess.
New
exists
After looking up the formula for calculating an intersection of two lines on wikipedia, part 1 was straightforward. I really do not know ...
New
New
woojiahao
Fun day today! Quite straightforward but the key observations are: SpoilersFinding the column-wise reflection line is the same as transp...
New
bjorng
I came up with a solution myself, but it is not fast. My first brute-force solution simply tried removing all combinations of three edg...
New
rbino
Hey everyone! FOSDEM 2023 is finally going to be in-person again and we’re excited to announce that the Erlang, Elixir and Friends Devro...
New
spawn-fest
Hello, community. SpawnFest 2023 will happen on Oct 28 & 29. What is it? SpawnFest is an annual 48 hour online software developmen...
New
lud
For part 2 I transformed the map into a graph because I wanted to see it and check if there was a bottleneck point or something. But no,...
New
CodeSync
VEB sold out in record time, so Early Bird tickets are now on sale! We want to thank you all for your excitement about this year’s Elixi...
New
chouzar
Code BEAM Lite México :mexico: will be taking place March next year in Mexico City. If you have something to share to the erlang, elixir...
New
bjorng
I went for a brute-force solution, implementing the most straight-forward algorithm I could think of. That initial implementation solved ...
New
woojiahao
Got top 1000 for part 1, part 2 was super long so I took a while to understand it. Pretty fun day overall!
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