Uploaded August 2020 | Updated September 2026, 2 days ago
I almost won... so close... yet so far...
What is Competitive Programming: youtube.com/watch?v=ueNT-w7Oluw
Scoreboard: codingcompetitions.withgoogle.com/kickstart/round/000000000019ff47
Second channel (William Lin ++): youtube.com/channel/UCL-s5-igta4aWXfXMmQHEow
Website: williamlin.io
Instagram: instagram.com/tmwilliamlin168
Twitter: twitter.com/tmwilliamlin168
Discord: williamlin.io/discord
I almost won... so close... yet so far...
What is Competitive Programming: youtube.com/watch?v=ueNT-w7Oluw
Scoreboard: codingcompetitions.withgoogle.com/kickstart/round/000000000019ff47
Second channel (William Lin ++): youtube.com/channel/UCL-s5-igta4aWXfXMmQHEow
Website: williamlin.io
Instagram: instagram.com/tmwilliamlin168
Twitter: twitter.com/tmwilliamlin168
Discord: williamlin.io/discord

![CodeChef January Cook-Off 2020 Discussion
Post-Contest discussion stream for CodeChef January Cook-Off 2020
06:15 CHFCHK
08:00 EXAMCHT
10:50 RGAND
17:55 CFINASUM
29:10 PRT
38:10 PLIND
48:10 CNTIT
Screencast during the contest: https://youtu.be/JYjnNvEPvt4
Comments, questions, requests, criticism, are all welcome!
I made a mistake while explaining PLIND: dp[i][j] is actually the number of ways to choose suffix of length i such that the prefix has j digits occurring an odd number of times. CodeChef January Cook-Off 2020 Discussion](https://i.ytimg.com/vi/eoyXk-DT4Js/mqdefault.jpg)








