Advent Of Code

912 readers

150 users here now

An unofficial home for the advent of code community on programming.dev!

Advent of Code is an annual Advent calendar of small programming puzzles for a variety of skill sets and skill levels that can be solved in any programming language you like.

AoC 2024

Solution Threads

M	T	W	T	F	S	S
						1
2	3	4	5	6	7	8
9	10	11	12	13	14	15
16	17	18	18	20	21	22
23	24	25

Rules/Guidelines

Follow the programming.dev instance rules
Keep all content related to advent of code in some way
If what youre posting relates to a day, put in brackets the year and then day number in front of the post title (e.g. [2024 Day 10])
When an event is running, keep solutions in the solution megathread to avoid the community getting spammed with posts

Relevant Communities

Relevant Links

Advent of Code Homepage

Credits

Icon base by Lorc under CC BY 3.0 with modifications to add a gradient

console.log('Hello World')

founded 1 year ago

MODERATORS

Ategon

[email protected]

CameronDev

🦌 - 2024 DAY 2 SOLUTIONS -🦌 (self.advent_of_code)

submitted 2 days ago by Ategon to c/advent_of_code

55 comments fedilink hide all child comments

Day 2: Red-Nosed Reports

Megathread guidelines

Keep top level comments as only solutions, if you want to say something other than a solution put it in a new post. (replies to comments can be whatever)
You can send code in code blocks by using three backticks, the code, and then three backticks or use something such as https://blocks.programming.dev if you prefer sending it through a URL

FAQ

What is this?: Here is a post with a large amount of details: https://programming.dev/post/22323136
Where do I participate?: https://adventofcode.com/
Is there a leaderboard for the community?: We have a programming.dev leaderboard with the info on how to join in this post: https://programming.dev/post/6631465

you are viewing a single comment's thread
view the rest of the comments

[–] [email protected] 9 points 2 days ago (1 children)

Haskell

This was quite fun! I got a bit distracted trying to rewrite safe in point-free style, but I think this version is the most readable. There's probably a more monadic way of writing lessOne as well, but I can't immediately see it.

safe xs = any gradual [diffs, negate <$> diffs]
  where
    diffs = zipWith (-) (drop 1 xs) xs
    gradual = all (`elem` [1 .. 3])

lessOne [] = []
lessOne (x : xs) = xs : map (x :) (lessOne xs)

main = do
  input :: [[Int]] <- map (map read . words) . lines <$> readFile "input02"
  print . length $ filter safe input
  print . length $ filter (any safe . lessOne) input

[–] [email protected] 4 points 2 days ago (3 children)

Love to see your haskell solutions!

I am so far very amazed with the compactness of your solutions, your lessOne is very much mind-Bending. I have never used or seen <$> before, is it a monadic $?

Also I can't seem to find your logic for this safety condition: The levels are either all increasing or all decreasing, did you figure that it wasn't necessary?

[–] [email protected] 1 points 1 day ago

Thanks! The other two posters already answered your questions, I think :)

Haskell makes it really easy to build complex operations out of simple functional building blocks, skipping a lot of boilerplate needed in some other languages. I find the compactness easier to read, but I realize that not everyone would agree.

BTW, I'm a relative Haskell newbie. I'm sure more experienced folks could come up with even more interesting solutions!

[–] [email protected] 3 points 2 days ago

For the last point, it isn't needed since the differences between elements should be all positive or all negative for the report to be safe. This is tested with the combination of negate and gradual.

I am also enjoying these Haskell solutions. I'm still learning the language, so it's been cool to compare my solution with these and grow my understanding of Haskell.

[–] [email protected] 2 points 1 day ago* (last edited 1 day ago)

<$> is just fmap as an infix operator.

>>> fmap (+1) [1,2,3]
[2,3,4]
>>> (+1) <\$> [1,2,3]
[2,3,4]