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

Advent Of Code

985 readers
71 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
[โ€“] morrowind@lemmy.ml 3 points 3 weeks ago

Smalltalk

day1p12: input    
	| list1 list2 nums dist sim |
	
	list1 := OrderedCollection new.
	list2 := OrderedCollection new.
	
	input linesDo: [ :l |
		nums := l substrings collect: [ :n | n asInteger ].
		list1 add: (nums at: 1).
		list2 add: (nums at: 2).
	].

	list1 sort.
	list2 sort.
	
	dist := 0.
	list1 with: list2 do: [ :a :b | dist := dist + (a - b) abs ].
	
	sim := list1 sumNumbers: [ :x | x * (list2 occurrencesOf: x) ].
	
	^ Array with: dist with: sim.