Algorithms Lecture #1: Sums and Expected Value

Lecture materials: http://codeforces.com/blog/entry/62690.

First, I will talk about the Expected Value - with definition, examples and simple problems. The only prerequisite is knowing what is probability.

Then we will move to problems like "find the sum over all intervals/subsets". Something that appears quite often in Codeforces or ACM ICPC contests.

Next part on Monday, 29-th, same time - continuation with harder problems!

You are welcome to ask questions when something is not clear.
If you miss the stream, the video will be available later anyway.

What is Competitive Programming? https://en.wikipedia.org/wiki/Competitive_programming
Follow me on Facebook: https://www.facebook.com/errichto
Competitive Programming Discord: https://discordapp.com/invite/UzaURu7

I'm known as Errichto. I compete in and organize programming competitions. I'm a finalist of ACM-ICPC, Topcoder Open, Facebook Hacker Cup and Google Code Jam. I got a second place in Google Code Jam 2018. Watch me if you want to practice Competitive Programming, algorithms or you want to learn for a coding interview. I share my thought process, explain everything, and mention similar problems that I know or techniques/algorithms that could be used too. Learn from me and grow your rating on Codeforces!