Day 1: Sonar Sweep

• r/adventofcode solution megathread

Part 1

Rephrased: Given a list of \(N\) positive integers, count the number of times there is an increase.

Part 2

Rephrased: Given the same list of \(N\) positive integers, and using a sliding window of size \(n\), count the number of times the sum of the values of a sliding window is larger than the values of the previous window