this post was submitted on 01 Dec 2024
51 points (98.1% liked)

Advent Of Code

977 readers
57 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 19 20 21 22
23 24 25

Rules/Guidelines

Relevant Communities

Relevant Links

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
 

Day 1: Historian Hysteria

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

you are viewing a single comment's thread
view the rest of the comments
[โ€“] [email protected] 3 points 2 weeks ago (2 children)

Solution in C

Part 1 is a sort and a quick loop. Part 2 could be efficient with a lookup table but it was practically instant with a simple non-memoized scan so left it that way.

[โ€“] mcmodknower 1 points 2 weeks ago* (last edited 2 weeks ago) (1 children)

You are using some interesting techniques there. I never imaged you could use the result of == for adding to a counter.

But how did you handle duplicates in part 2?

[โ€“] [email protected] 1 points 2 weeks ago

Iโ€™m not sure if I understand the question correctly but for every number in the left array I count in the right array. That means duplicate work but shrug ๐Ÿ˜