Hello Codechef Community this CodeNCode
I am working on segment tree course project in which I will be covering concepts as easy as range minimum query to persistence segment tree.
The course is built emphasizing on “learning by doing” methodology , so we will be solving problems after learning concepts to implement those concepts to make sure we have understood those concepts and to know if we are having some problems with that or we are good to go.
I am not a professional trainer so you can expect I will not be “Perfect” In teaching but I will try to give my best shot.
The best thing about the course is I will be available to take on your queries and try to help you out here in the comments section.If you have any doubt or query make sure you ask here not on youtube (There are many reasons for it).
Here is the list of lectures added in the course till now.
L00 : Course Overview
L01 : Introduction to Segment Tree
L02 : Segment Tree Implementation
L03 : RMQSQ (SPOJ) | Practice Problem
L04 : Segment Tree Point Updates
E001 : Help Ashu (HackerEarth) | Point Update Practice Problem
L05 : Lazy Propagation Introduction
L06 : Lazy Propagation Implementation
E001 : Multiples of 3 (Medium) | Codechef
L07 : Introduction To Merge Sort Tree
L08 : Merge Sort Tree Implementation & Space Complexity
L09 : Merge Sort Tree Answering queries
E001 : K-Query | Spoj
There are more lectures to be added. If you have any doubts/query/suggestion , please let me know in the comments. Thank you for your valuable time. CodeNCode out.