mirror of
https://github.com/peter-tanner/advent-of-code-2022.git
synced 2024-11-30 14:20:22 +08:00
rust 🤓🤓🤓🤓 and python when i feel lazy
Peter
2ae5cce33d
this is the part where the challenges start to get hard. implementing the naive solution for part 1 did not take much time. used a hashset since it's easier than using arrays, but slightly less performant. I expected the naive solution would not work for part 2 due to the size of the problem but it still worked, although it did take a few seconds to finish. the solution i would have used if part 2 took too long would be to trace some 45* rays from the end points of horizontal beams and subtract the area inside from the largest sand triangle. |
||
|---|---|---|
| day_1 | ||
| day_2 | ||
| day_3 | ||
| day_4 | ||
| day_5 | ||
| day_6 | ||
| day_7 | ||
| day_8 | ||
| day_9 | ||
| day_10 | ||
| day_11 | ||
| day_12 | ||
| day_13 | ||
| day_14 | ||
| day_15 | ||
| day_16 | ||
| day_17 | ||
| day_18 | ||
| day_19 | ||
| day_20 | ||
| day_21 | ||
| day_22 | ||
| day_23 | ||
| day_24 | ||
| day_25 | ||
| .gitignore | ||