aoc2021 VS adventofcode

I've been doing similar (in three langs, though Ive fallen behind on go and rust over the past few days) -- https://github.com/A-UNDERSCORE-D/aoc2021/blob/main/aoc/go/util/slice.go is most of my generic go fun, lots of implementations of higher order functions and nice wrappers

Python source

As usual, first implementation. Actually started by doing sum(range(1, steps+1)), and after solving remembered that theres a math thing for that (sum(0..n) = n * (n + 1) / 2). Nothing super fancy other than that. Code Finally starting to see speedup from pypy. That JIT is amazing but has its costs.

https://github.com/A-UNDERSCORE-D/aoc2021/blob/main/aoc/go/six/06.go -- Nothing super fancy. Nice ability to pick arrays over slices here though. Probably contributes a bit of speedup.

The only code differs for two parts is as follows - https://github.com/bhosale-ajay/adventofcode/blob/master/2023/ts/D07.test.ts - under 80 lines.

Easy day TypeScript, P1 - Brute Force, P2 - Formula

[LANGUAGE: TypeScript] Github - Under 40 lines, all parts running under 8ms.

[LANGUAGE: TypeScript] TypeScript - Running under 30ms (both parts)

F# This year I solved puzzles using TypeScript as well as F# - Day 18, 19, and 22 TBD

F# - After looking at some Python solution calculated the position of blizzard for nth time instead of maintaining the grid, which makes it easier with F#.