This course offers a comprehensive exploration of C++ programming and data structures. Beyond fundamental concepts like variables and control flow, you'll delve into advanced topics such as pointers and dynamic memory allocation, linked lists, stacks, queues, and trees, recursion, and object-oriented programming. By the end of this course, you'll be equipped with the skills to tackle complex problem-solving challenges and design efficient data structures.

This course provides a solid foundation in algorithm design, covering techniques to create efficient algorithms, prove their correctness, and analyze their performance. Key topics include mathematical analysis of algorithms (summations and recurrences), advanced data structures (balanced search trees), algorithm design techniques (divide-and-conquer, dynamic programming, and greedy algorithms), and graph algorithms (breadth-first and depth-first search, minimum spanning trees, shortest paths). By the end of this course, we expect to cover nearly all needed algorithms and data structures for preparing to IOI (International Olympiad in Informatics), so you can start writing contests and attempting advanced problems.

This course is designed for students with prior experience in competitive programming and advanced data structures and algorithms. The course structure consists of 5-hour contests followed by 2-hour editorials. Additional special sessions will be conducted as needed to clarify specific concepts. Contests will be carefully selected from prestigious Olympiads such as BOI, CEOI, IZHO, Innopolis Open, APIO, and IOI. The ultimate goal of this course is to cultivate future IOI medal winners.