### pashka's blog

By pashka, history, 3 years ago,

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.

Go to EDU →

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!

• +553

| Write comment?
 » 3 years ago, # | ← Rev. 4 →   +5 This is epic!Suggestions for future topics: Tries, Ternary search, TreesAlso I noticed that this lesson and this lesson are only available in Russian. It would be good if they can be translated into English so more people can learn. Thanks!
 » 3 years ago, # |   0 Ternary Search Please
•  » » 3 years ago, # ^ |   0 Hi! Ternary search is not much important if you know binary search. Ternary search problems can also be solved using binary search. In binary search you will go the mid element and check for the previous and next element and based on your check condition you can either go to left or right.
•  » » » 3 years ago, # ^ |   0 You can't do that if the values can be non-integer.
•  » » » » 3 years ago, # ^ |   0 I am just asking in curiosity. Even if the values are non-integer, and the error allowed in the problem is 'delta' (let which is generally 1e-6). Then can't we check for mid+delta and mid-delta and then eliminate half part according to the check condition.
•  » » » » » 3 years ago, # ^ |   0 You just explained terrnary search, the only difference is that usually in terrnary search the values you mentioned (mid-delta, mid+delta) are selected in a way that they divide the range into 3 equal parts (that's why it's ternary), which makes the code better and less likely to fail because of precision errors.
 » 3 years ago, # |   +3 Thanks for this. Suggestions : Graphs topics like Trees, DP on Trees, etc.
 » 3 years ago, # |   +31 FFT please! By the way, i appreciate your work.
 » 3 years ago, # |   +25 Sqrt Decomposition please
•  » » 3 years ago, # ^ |   0 I am not sure but do we need it when we have segtrees?
•  » » » 3 years ago, # ^ | ← Rev. 2 →   -10 i guess there are some differences on memory usage and time complexity witch makes it better than segtree in some cases.
•  » » » 3 years ago, # ^ |   0 Yes, of course. Square root decomposition can handle some types of queries that segment tree can't (or at least it isn't clear that you can handle them).
 » 3 years ago, # |   +13 My suggestion would be Number Theory and Combinatorics.
 » 3 years ago, # |   +9 Epic !! Next courses suggestion — Tries
 » 3 years ago, # |   +3 what about SCC and topological sort, or 2-sat?
 » 3 years ago, # |   +2 Combinatorics, and NOT dp
 » 3 years ago, # |   +1 Combinatorial counting theory please.
 » 3 years ago, # |   0 string
 » 3 years ago, # |   0 Your content is great and very easy to understand! I think more lectures in some hard DP topics (e.g. DP knapsack on Tree, DP on Trie, DP Sum over subsets) or maybe some problems that are a combination of simpler algorithms (like, greedy + DAG, bitmask + shortest paths ...) would be very helpful for a lot of people that know all of the basics, yet struggling to apply them into actual problems.
 » 3 years ago, # |   0 PLEASE DO A COURSE ON COMPUTATIONAL GEOMETRY