🎄🧑‍💻 Day 1: Sonar Sweep

Go here to read Day 1 puzzle text in full. Part 1 The first half of the problem is rather straightforward: we have to read a list of integers and count how many times the number in the i-th row is greater than the one in the i-1 row. This is equival...