This level is intended to test that the candidate is an expert in algorithms and data structures, and has a deep understanding of the topics. Candidates can expect problems from the following topics to come in the exam.
The syllabus for Expert Level is open-ended. Everything in Advanced Level will be included, along with:
This level is intended to test that the candidate has a very good grasp of algorithms and data structures, and can solve most problems that arise in practice. Candidates can expect problems from the following topics to come in the exam.
Everything in the Foundation Level, along with:
Heaps (priority queue)
Disjoint Set Union
Binary Index Tree (Fenwick tree)
Trees (traversals, tree dynamic programming)
Finding Lowest Common Ancestors (O(log N) solution where N is number of nodes).
Finding connected components and transitive closures.
Practice Problems: Please solve the problems mentioned in the above segment tree practice problems section. Note that usually, it's difficult to do range updates in binary indexed trees. Mostly, it is used for for range query and point update. However, you can check the following article for checking how some simple specific kind of range updates can be peformed on binary indexed tree (http://petr-mitrichev.blogspot.in/2013/05/fenwick-tree-range-updates.html). Note that range updates on BIT is not a part of the syllabus.