My solutions to Advent of Code.
Here is a list of references that I've found on the webs that helped me when I got stuck
- https://math.stackexchange.com/questions/147152/how-to-find-the-meeting-number-of-two-sequences
- https://en.wikipedia.org/wiki/Extended_Euclidean_algorithm
- https://www.discoverbits.in/post/extended-euclid-algorithm-for-gcd-in-python/
- https://cronokirby.com/posts/2020/12/chinese-remainder-theorem/
MIT, as always.