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

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

Last week home task discussion will be on Sunday at 17:00 MSK.

See you tomorrow!

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

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

See you tomorrow!

Hello Codeforces!

The second semester starts next week! As usual, the live lectures will be on Twitch on Fridays at 18:00 MSK, and the recorded videos will be on Youtube.

Topics of the second semester:

• Segment Trees and similar data structures
  • Segment Tree
  • Fenwick Tree
  • Sparse Table
  • 2D Trees
• Binary Search Trees
  • AVL Tree
  • Treap
  • Splay Tree
• Data Structures for Trees
  • Binary Lifting
  • LCA and LA problems
  • Heavy-Light Decomposition
  • Link-Cut Tree
  • Centroid Decomposition
• Plus something more :)

See you!

Hello Codeforces!

It's been a long time since I posted a lesson in EDU section. Sorry about that, was quite busy managing my course on Youtube.

New lesson is about two pointers method.

What topics you want to learn next? I would prefer topics not covered in my Youtube course, something more specific for competetive programming. Any ideas?

More about EDU section you can read in this post.

Thanks to Stepavly and Supermagzzz for their help with lecture notes and testing problems.

Enjoy the lesson and good luck on the contests!

Hey CodeForces!

So, the first bonus lecture worked out pretty well, let's have another one!

Tomorrow at 17:00 MSK we will discuss Link-Eval data structure, part of this work by R. E. Tarjan.

See you!

Hey CodeForces!

Thank you for your warm support for my online lectures! Now it's winter vacation in Russia, next semester will start in February. I want to use this time to try some topics which were not included in the main course (mainly because it's already too big).

The first lecture will be on Saturday at 17:00 MSK, I will talk about this classical work by R. E. Tarjan explaining the $$$α(m, n)$$$ time complexity of Union-Find data structure.

If you're not familiar with Union-Find data structure, you can watch my lecture, or take this lesson in EDU.

See you!

UPD. There is a Div2 round tomorrow, so I moved the lecture to Saturday.

Here is the video of the lecture. 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.

Here is the video of the lecture. 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!

Here is the video of the lecture. 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 two lectures.

See you next week!

Here is the video of the lecture. 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 two lectures.

See you next week!

Here is the video of the tenth 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 two lectures.

See you next week!

Here is the video of the ninth 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 two lectures.

See you next week!

Here is the video of the eighth 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 two lectures.

There will be no lecture next week so see you in two weeks!

Here is the video of the seventh 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 two lectures.

See you next week!

Here is the video of the sixth 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 two lectures.

See you next week!

Here is the video of the fifth 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.

Unfortunately, I won't be able to have a homework discussion tomorrow, so we'll discuss both homework next week.

See you next week!

Here is the video of the fourth 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!

Here is the video of the third 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 14:00 MSK we will have a stream on Twitch where I will comment your solutions from the previous lecture.

See you next week!

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!

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

I prepared some home tasks, if you want to practice you can solve them and send your solutions into this form. I plan to make special stream on Twitch where I will comment your solutions (probably not all of them, but pick some at random). Stay tuned.

One more thing. It will be nice to have subtitles for the videos, but it takes too much time to do it myself, so I opened the community contribution for the subtitles. Please join if you want to contribute.

See you next week!

Thank you for your response to my previous post. I checked your feedback and it looks like the optimal time for the lecture is Friday evening. So the first lecture will be on September 11 at 18:00 MSK (15:00 UTC).

In the first lecture we'll start with the basics. We will discuss what an algorithm is, and how to measure its efficiency. Also we will discuss merge sort algorithm, and illustrate how to use this theory to analyse its complexity.

You can check this calendar for the schedule of my streams.

See you!

Hello Codeforces!

I teach a course on algorithms and data structures at ITMO University. During the last year I was streaming all my lectures on Twitch and uploaded the videos on Youtube.

This year I want to try to do it in English.

This is a four-semester course. The rough plan for the first semester:

• Algorithms, complexity, asymptotics
• Sorting algorithms
• Binary heap
• Binary search
• Linked lists, Stack, Queue
• Amortized analysis
• Fibonacci Heap
• Disjoint Set Union
• Dynamic Programming
• Hash Tables

The lectures are open for everybody. If you want to attend, please fill out this form to help me pick the optimal day and time.

See you!

Hello Codeforces!

New lesson in English EDU section. This time I will talk about binary search.

More about EDU section you can read in this post.

Hope it will be helpful, enjoy!

Hello everyone!

I just published a new lesson in the EDU section. This is the first part of the lesson about the segment tree.

In this lesson, we will learn how to build a simple segment tree (without mass modifications), and how to perform basic operations on it. We will also discuss some tasks that can be solved using the segment tree.

More about EDU section you can read in this post.

Hope it will be helpful, enjoy!