advent_of_code_2022 VS advent-of-code

You can find my solution on advent-of-code/AdventOfCode2017/Day01 at main · messcheg/advent-of-code (github.com)

In F# its the method FuelInOre see: https://github.com/messcheg/advent-of-code/blob/main/AdventOfCode2019/Day14/Program.fs

After 1 hour and 35 minutes, I had a working C# program that uses a sort probabilistic hillclimbing algorithm to solve the problem in 170 miliseconds.

I also made functions to calculate with snafu-rules. I even didn't translate '=' and '-' to -2 and -1. I used C# to do that.

I have looked at other people's codes and still can't figure it out, eg https://github.com/messcheg/advent-of-code/blob/main/AdventOfCode2022/Day16/Program.cs which is very similar to mine (I think).

My code is in https://github.com/messcheg/advent-of-code/tree/main/AdventOfCode2022/Day17.

Made my solution in C# (https://github.com/messcheg/advent-of-code/tree/main/AdventOfCode2022/Day16) Took me a lot of time to make solution for part I (due to the fact that it's early in the morning here and I need to finish before the other life in my house starts..). But I spent only half-an-hour, to get the answer for part II. (Rank 3675 after part I, rank 1797 after part II).

The solution on: https://github.com/messcheg/advent-of-code

I had a slightly different approach (in C#). Instead of copying the values, I just changed the index of the first group. I actually don't what would be faster: copying 9 values or performing two modulo operations. See https://github.com/messcheg/advent-of-code/tree/main/AdventOfCode2021/Day6