... conquer the challenge and 65 lines to elegantly extract the info from the input string.💻🕹️ #AdventOfCode #CodingTriumph #PythonMagic #hustler

... of Code for some recreational coding fun! 💻🎄 #AdventOfCode #CodingChallenge #TechEnthusiast #hustler

... However, Day 3 has me in a puzzle-induced trance. Time to unravel the enigma and crack the code! 🕵️‍♂️🤔 #AdventOfCode #CodingChallenge #ChallengeAccepted #hustler

... challenges, sharpen those coding skills, and embrace the festive coding spirit. May the debugging elves be on our side! 💻🎄 #AdventOfCode #CodingAdventure #ChallengeAccepted #hustler

Hi zusammen, der Advent of Code hat wieder begonnen, natürlich am 01.12. und nicht heute, aber leider bin ich nicht dazu gekommen vorher zu schreiben, mich hat das lustige C erwischt und ein paar Tage

Perusing the interwebs I saw a post for the Advent of Code, and figured I would jump in. Ok, I really thought this post would have more words. Anyway, to elaborate Advent of Code is a collection of coding

Sorry that I am blogging via my phone and I don't want to type too much. I will just share the finished code. You can see all of them on GitHub. Advent of Code 2022 Day 3 Part 1 inputs <- read.table('

Sorry that I am blogging via my phone and I don't want to type too much. I will just share the finished code. You can see all of them on GitHub. Advent of Code 2022 Part 1 inputs <- readLines(' choices

Sorry that I am blogging via my phone and I don't want to type too much. I will just share the finished codes. You can see all of them on GitHub Part 1 inputs <- readLines(' elves <- c() elf <-

A classic

Day 13 is a simulation of carts on tracks. The track layout is given by an ASCII diagram, like this one: /->-\ | | /----\ | /-+--+-\ | | | | | v | \-+-/ \-+--/ \------/ I decided it would be better

Day 12 asks us to implement a cellular automaton. There's a lot of flavor text, but that's basically it. The rules are part of the puzzle; I don't know if they're actually different for everyone or not.

Haskell has a maximum function and it has lazy evaluations of lists. I come from Python that has a max function and list generators. But there turns out to be a crucial difference. Day 11 asks us to find

Day 8's puzzle was basically just about parsing a long list of integers correctly, and writing tree-recursive functions correctly. Both are pretty easy in Haskell. I defined the tree object like this,

I completely gave up on solving the Advent of Code problems as they went up, and I'm backfilling the days I missed, which is most of them. Day 5 was the first time I really felt happy with my Haskell solution,

The Day 7 puzzle is about parallel builds. So, just convert your input into a Makefile and solve it with GNU Make! OK, maybe not. I probably could have gotten that working in less time than it took me

Day 3 and 4 kinda kicked my butt (plus I had work stuff both nights) but I finally finished day 4. It asks us to solve a scheduling problem, and the example even shows us a nice matrix we could use. I

Took me a little longer this time. I can't keep up with the 9 pm nightly challenge. Thank goodness I don't live on the east coast, I don't know how they do it. Too busy and too many kids for me even to

Advent of Code Day 2 asks us to do some string searches. It took me about 40 minutes, and I can't say I'm particularly happy with the results, but it worked. Part 1 asks us to find the number of words

I'm doing Advent of Code in Haskell this year, as planned. I warmed up with one of last year's problems so I was able to get started right away at 11pm last night when the puzzle went live. It still took