aoc VS adventofcode

Full code at GitHub.

Edit: you don't need to determine the type of hand, but you can directly compare the card counts. Second version @GitHub.

New version @GitHub.

So, a new version with a lot less almost-duplicate code @GitHub.

@GitHub

Completed part 2, see GitHub. I couldn't really use the same `DiracDice` class and simply use another `Die`, but had to create a separate `DiracDice2` class.Basically, just keep track of the possible universe state and their counts, and try all possible combinations of die rolls. Keep playing until all universes have a winner.

The rest is the same as my first attempt, but full code at GitHub.

I spent way too much time on this, but I completed my original attempt with the proper object model, see GitHub

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#.