advent-of-code-2021 VS Advent-of-Code-2021

I assumed that you could only go right and down but got the wrong answer when I submitted for my input. Went back and actually read it properly and saw there was nothing about only right or down so rewrote it to use Dijkstra.

I made another solution (Common Lisp) which I like better than my original one, even though there's more code supporting it (https://github.com/blake-watkins/advent-of-code-2021/blob/main/day8.lisp). The essential functions are:

Common Lisp 365/3502

So this year I'm solving Advent of Code in SvelteKit.

This is my first time participating in this Advent of Code 2021 activity, my Day 1 code is as follows.

Not SwiftUI, but raw Swift: I recommend checking out https://adventofcode.com/2021 (and previous years), plus of course r/adventofcode

Rust [code] [explanation]

Alright, today is day 5 of advent of code, we have an interesting challenge involving points and lines (or vectors) in a 2D plane. Below I will share and explain my proposed solution in Kotlin.

This year for the first time I decided to take part in the Advent of Code 2021 challenge using the shell scripting language for GNU Bash.

Code: https://github.com/agubelu/Advent-of-Code-2021/blob/master/src/days/day04.rs