AdventOfCode2022CSharp VS adventofcode

C# solution using .NET Interactive and Jupyter Notebook. Used a recursive drop function to simulate a single grain of sand falling. Part 2 is not particularly efficient (~600ms). I went with a brute force approach solving it the same way as Part 1. But saw some clever "ray-casting" methods here in the comments!

C# solution using .NET Interactive and Jupyter Notebook. A bit of a tricky one today. Like many, used JSON parsing using the new System.Text.Json library. Then used a custom Comparer for the OrderBy LINQ method for Part 2.

C# solution using .NET Interactive and Jupyter Notebook. Part 1 was pretty straight forward by creating my own Monkey class. For Part 2, had to get some hints here on how to manage the very big numbers.

C# solution using .NET Interactive and Jupyter Notebook. Created an IEnumerable that yield returns the register value during the cycle (made the mistake of returning the value at the end of the cycle at first). Then used LINQ on the Enumerable to solve Part 1 and 2.

C# solution using .NET Interactive and Jupyter Notebook.

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