Advanced Classes for Competitive Programing

In this lecture, we will be discussing the concept of Persistence in Data Structures. Specifically, we'll look at various methods of making Segment Trees persistent and discuss their implementation.

Nov 20, 2020 • 1h 2m

Educator Nishchay Manwani is Seven star on Codechef and International Grandmaster on Codeforces. This session is oriented towards division 1 participants and is a part of a 3 day workshop, 'Indian Programming Camp', in which he will discuss the basics of Linear Algebra and how to use it in Competitive Programming. Specifically how to use linear algebra on XOR related queries.

Nov 20, 2020 • 1h 14m

In this lecture we will be discussing what is bi-connectivity. Specifically we will cover Bridge Finding Algorithm and the data structure Bridge Tree (we will discuss its properties + implementation + application to problems)

Nov 20, 2020 • 1h 45m

In this lecture we will be discussing the suffix array data structure, commonly used to solve strings related questions. Our focus will be on how the suffix array is built (i.e implementation), its properties and how we can use it to solve actual string questions.

Nov 21, 2020 • 2h 25m

In this lecture we will introduced the concept of Centroid Decomposition on Trees and show how it can be used to solve different types of update and query problems on trees. We will also discuss the concept of Persistent Centroid Tree.

Nov 21, 2020 • 2h 0m

Educator Nishchay Manwani is Seven star on Codechef and International Grandmaster on Codeforces. This session is oriented towards division 1 participants and is a part of a 3 day workshop, 'Indian Programming Camp', in which he will discuss the basics of Flow and flow related properties and algorithms and how to use it in Competitive Programming.

Nov 21, 2020 • 2h 8m

Educator Nishchay Manwani is Seven star on Codechef and International Grandmaster on Codeforces. This session is oriented towards division 1 participants and is a part of a 3 day workshop, 'Indian Programming Camp', in which he will discuss Fast Fourier Transform and some of its variants. Specifically many polynomial operations using FFT will be discussed.

Nov 22, 2020 • 2h 17m

In this lecture, we will discuss a trick called Persistent Centroid Decomposition. We will motivate the idea by looking at a hard problem and show how it can be easily solved by performing Centroid Decomposition on the given tree and then making the Centroid Tree Persistent.

Nov 22, 2020 • 1h 59m