JS solutions: github.com/lionel-lbr/a...
JS solutions: github.com/lionel-lbr/a...
2 stars away from 50 ...
2 stars away from 50 ...
Not that difficult actually, but lost time because: "until the first time it sees that sequence", next occurrence of the same sequence are ignored
Full JS solution: github.com/lionel-lbr/a...
Not that difficult actually, but lost time because: "until the first time it sees that sequence", next occurrence of the same sequence are ignored
Full JS solution: github.com/lionel-lbr/a...
Second solutions works for example 2 but not for example 1 !!! 😖
Second solutions works for example 2 but not for example 1 !!! 😖
github.com/lionel-lbr/a...
github.com/lionel-lbr/a...
2 sourdough loafs: 30% white, 40% whole, 30% whole rye.
… before and after …
#sourdough
#breadsky
#bakesky
#theperfectloaf
#countrysidebread
#tartine #tartinebread
2 sourdough loafs: 30% white, 40% whole, 30% whole rye.
… before and after …
#sourdough
#breadsky
#bakesky
#theperfectloaf
#countrysidebread
#tartine #tartinebread
#sourdough
#breadsky
#bakesky
#theperfectloaf
#countrysidebread
#tartine #tartinebread
#sourdough
#breadsky
#bakesky
#theperfectloaf
#countrysidebread
#tartine #tartinebread
Pure math solution: github.com/lionel-lbr/a...
Pure math solution: github.com/lionel-lbr/a...
Much simpler version than my previous post: github.com/lionel-lbr/a...
Much simpler version than my previous post: github.com/lionel-lbr/a...
All solutions up to today here: github.com/lionel-lbr/a...
#javascript
All solutions up to today here: github.com/lionel-lbr/a...
#javascript
github.com/lionel-lbr/a...
Part 2 need DFS with LRU cache.
⬇️
github.com/lionel-lbr/a...
Part 2 need DFS with LRU cache.
⬇️
So mush easier with a simple DFS ...
github.com/lionel-lbr/a...
I don't know why when i see a 2D grid I just want to parse it in xy and never think about tree parsing ...
#adventofcode2024
So mush easier with a simple DFS ...
github.com/lionel-lbr/a...
I don't know why when i see a 2D grid I just want to parse it in xy and never think about tree parsing ...
#adventofcode2024
Classic pathfinding algorithm where you can only go to next higher positions. With a twist to count ending position of a path or count unique path.
github.com/lionel-lbr/a...
Best time so far 😊
Classic pathfinding algorithm where you can only go to next higher positions. With a twist to count ending position of a path or count unique path.
github.com/lionel-lbr/a...
Best time so far 😊