Introduction
This course aims to prepare students in competitive problem solving.
It will benefit students who want to compete in ICPC, invited high school students who want to compete in IOI, and students in general who aspire to excel in technical interviews of top IT companies.
It covers techniques for attacking and solving challenging computational problems. Fundamental algorithmic solving techniques covered include complete search, divide/reduce/transform and conquer, greedy, dynamic programming. Domain specific techniques like graph, mathematics-related, string processing, and computational geometry will also be covered.
Programming language libraries that are commonly used in problem solving will also be taught.
Prerequisites
- COMPETITIVE PROGRAMMING I
Syllabus
- Computational Geometry
- Combinatorics
- Probability & DP on Probability
- Trees
- Bi-Connected Component
- Suffix Array & LCP
- Matrix Exponentiation
- Eulerian Graph
- Strongly Connected Component & 2-SAT
- Network Flow
- Dynamic Programming (DAGs & Trees)
- Dynamic Programming on DS
- Binary Indexed Tree – Multidimensional
- Binary Indexed Tree – Range Update
- Segment Tree – Dynamic
- Persistent Segment Tree
- Game Theory
- Sparse Table
- Lowest Common Ancestor
- Square Root Decomposition & MO's algorithm
- Heavy Light Decomposition
You will be tested at the end of the training. If you do not pass the test, you will repeat the same training for free.
Duration
- 10 - 20 Weeks
- 2 - 4 Sessions per week
- 3 Hours per session.