A simple method for Chinese Remainder Theorem (solving system of congruences), without any modular inverse. Here's my code for Advent of Code day 13 https://github.com/Errichto/youtube/b...

0:00 Example 1
2:02 In General
2:56 LCM
4:05 Big Example
7:31 Extra Understanding

Subscribe for more educational videos on algorithms, coding interviews and competitive programming.

- Github repository: https://github.com/Errichto/youtube
- Live streams on 2nd YT channel and on Twitch:    / errichto2   &   / errichto  
- FB and Twitter:   / errichto   &   / errichto  
- Frequently Asked Questions: https://github.com/Errichto/youtube/w...