aoc2021apl VS adventofcode

Dyalog APL p←⍎¨¨'\d+'⎕S'&'¨⊃⎕NGET'p5.txt'1 to←{⍺+(×⍺-⍵)×⎕IO-⍳1+|⍺-⍵} f←{x1 y1 x2 y2←⍵ ⋄ ∨/x1 y1=x2 y2:(x1 to x2),¨y1 to y2 ⋄ ⍬} +/1<{≢⍵}⌸⊃,/f¨p ⍝ part 1 g←{x1 y1 x2 y2←⍵ ⋄ (x1 to x2),¨y1 to y2} +/1<{≢⍵}⌸⊃,/g¨p ⍝ part 2

Dyalog APL

Python day 17 solution (GitHub). Not the fewest lines of code, but used dataclasses and modular functions to try improve readability -- I got very confused with keeping track of indices of velocities vs coordinates in other people's posted solutions. I find dataclasses in Python can be a great way to be descriptive about the quantities you are iterating

Python day 15 solution (GitHub) using Networkx for graph algorithm and Numpy for building the bigger grid. Solutions to other days available in this repo

Python day 14 solution (GitHub). Tried splitting out the logic into individual functions to aid readability.

Python day 13 solutions (GitHub). Using Dataclasses to improve readability

Python solution (GitHub) using Gauss formula for part 2

Python solution using deque (GitHub). Much faster than my first attempt, lol

Python day 5 solutions using Bresenham's algorithm (Github)

Python solution day 4 OOP (GitHub). Probably not the fewest lines of code but uses dataclasses and OOP to manage the states of each bingo card

Python day 2 solution (GitHub)

Python day 1 solution (GitHub) using numpy's convolve function for sliding window calc