✨ Add 2024 day 22 solutions

Author: vegeta897

2024/22/README.md

@@ -0,0 +1 @@
+Pretty fun! I went through an enjoyable process of optimizing my part 2 approach by leaps and bounds.

2024/22/index.test.ts

@@ -0,0 +1,21 @@
+import { expect, test } from 'bun:test'
+import { getPart1Answer, getPart2Answer, part1Examples, part2Examples } from '.'
+import { logAnswer } from '@scripts/log'
+
+const inputText = await Bun.file(`${import.meta.dir}/input.txt`).text()
+
+test('solutions', () => {
+	console.log('  🌟 Part 1 answer:', getAndLogAnswer(1))
+	part1Examples.forEach(([i, a]) => expect(`${getPart1Answer(i, true)}`).toBe(`${a}`))
+	console.log('🌟🌟 Part 2 answer:', getAndLogAnswer(2))
+	part2Examples.forEach(([i, a]) => expect(`${getPart2Answer(i, true)}`).toBe(`${a}`))
+	expect(1).toBe(1) // Ensures that console logs always run
+})
+
+function getAndLogAnswer(part: 1 | 2) {
+	console.time(`P${part}`)
+	const answer = `${(part === 1 ? getPart1Answer : getPart2Answer)(inputText)}`
+	console.timeEnd(`P${part}`)
+	logAnswer(import.meta.dir, part, answer)
+	return answer
+}

2024/22/index.ts

@@ -0,0 +1,77 @@
+const parseInput = (input: string) =>
+	input
+		.trim()
+		.split('\n')
+		.map((v) => +v)
+
+const mix = (input: number, secret: number): number => (input ^ secret) >>> 0
+const prune = (secret: number): number => secret % 16777216
+
+const getNextSecret = (input: number): number => {
+	const stepOne = prune(mix(input * 64, input))
+	const stepTwo = prune(mix(stepOne / 32, stepOne))
+	const stepThree = prune(mix(stepTwo * 2048, stepTwo))
+	return stepThree
+}
+
+export const getPart1Answer: Answer = (input, example = false) => {
+	const parsed = parseInput(input)
+	let sum = 0
+	for (const secret of parsed) {
+		let result = secret
+		for (let i = 0; i < 2000; i++) {
+			result = getNextSecret(result)
+		}
+		sum += result
+	}
+	return sum
+}
+
+export const part1Examples: Example[] = [
+	[
+		`1
+10
+100
+2024`,
+		'37327623',
+	],
+]
+
+export const getPart2Answer: Answer = (input, example = false) => {
+	const parsed = parseInput(input)
+	const summedSequencePriceMap: Map<string, number> = new Map()
+	let bestSum = 0
+	for (const secret of parsed) {
+		const diffList: number[] = []
+		const thisListSequences: Set<string> = new Set()
+		let result = secret
+		for (let i = 0; i < 2000; i++) {
+			const nextSecret = getNextSecret(result)
+			const price = nextSecret % 10
+			const diff = price - (result % 10)
+			if (price > 0 && i >= 3) {
+				const sequenceKey = `${diffList.at(-3)!},${diffList.at(-2)!},${diffList.at(-1)!},${diff}`
+				if (!thisListSequences.has(sequenceKey)) {
+					thisListSequences.add(sequenceKey)
+					const existingSum = summedSequencePriceMap.get(sequenceKey) || 0
+					const newSum = existingSum + price
+					if (newSum > bestSum) bestSum = newSum
+					summedSequencePriceMap.set(sequenceKey, newSum)
+				}
+			}
+			diffList.push(diff)
+			result = nextSecret
+		}
+	}
+	return bestSum
+}
+
+export const part2Examples: Example[] = [
+	[
+		`1
+2
+3
+2024`,
+		'23',
+	],
+]

README.md

@@ -12,4 +12,8 @@ The test runner will then begin, in watch mode. Copy your puzzle input into `inp
 
 Answers will be logged to `answers.log` in the day folder, for your own reference. Duplicate answers will be ignored.
 
+## TODO
+
+Allow appending a,b,c to day
+
 _Repo structure inspired by [itswil's template](https://github.com/itswil/advent-of-code/)_