Chinese Remainder Theorem, 2-minute Method

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 github.com/Errichto/youtube/blob/master/AOC-2020/1… 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: github.com/Errichto/youtube - Live streams on 2nd YT channel and on Twitch: youtube.com/errichto2 & www.twitch.tv/errichto - FB and Twitter: www.facebook.com/errichto & twitter.com/errichto - Frequently Asked Questions: github.com/Errichto/youtube/wiki/FAQ

• #education
• #chinese_remainder_theorem
• #crt
• #math
• #programming
• #advent_of_code
• #modulo
• #ccon