Here is the video of the second lecture of the course. Thanks to everyone who watched the live stream.

Here are the home tasks for the lecture, you can submit your solutions into this form.

Tomorrow at 13:00 MSK we will have a stream on Twitch where I will comment your solutions from the previous lecture.

See you next week!

Your lectures are pure gold! Thank you so much! :)

What is the schedule now? I missed this time too.

never mind, I confused with the homework checking schedule.

Thanks

It was superfun watching your lecture,it felt like minutes.....

Consider changing the thumbnail style for your lectures in English. It's now hard to see/find them because everything looks so similar.

screenshotI'm not that creative :( But there is a special playlist for English videos

Should I make a new thumbnail ? Will you be willing to consider it if it's good ?

You can definitely try, but I don't promise anything :).

Okay great, I will get back to you by 25th with some new thumbnail ideas.

Please explain how to mathematical drive the time complexity of remove and insert operation in heap. In the lecture only a rough idea is given i.e each time we iterate to the next/ previous layer of the tree and since the height of the tree is log(n) thus the time complexity will be that, this is what I understood but I am having trouble in driving the time complexity. Please help.