Legend

Master

Expert

Star

Rising Star

Singapore

Woohoo! You’re officially a learning rockstar. Keep racking up more thousands!

1000 minutes

Your first century, you did it! Go ahead, tell the world. 

100 minutes

Woot! You're halfway to a century of learning minutes. Keep going strong!

50 minutes

Congratulations on your first learning milestone! Here's to many more in the future. 

10 minutes

Sidhant Bansal

We will be covering how to approach dynamic programming problems from past INOIs and IOI-TCs. 

The aim would be to cover the algorithmic approach, reason why its correct, reason how fast it is and implement it.

Pre-requisite: Since this is a problem solving class, some fundamental understanding of how dynamic programming works and is implemented is expected from the participants.

Competitive Programming

DP for OI - Problem Solving - Part 3

Intermediate

Dynamic Programming & Recursion

DP for OI - Problem Solving - Part 2

Miscellaneous

ICPC and IOI

DP for OI - Problem Solving - Part 1

In this lecture we will cover the concept of string hashing using polynomial rolling hash functions. 

An elementary knowledge about number theory (i.e modulo arithmetic and modulo inverse) prior to this lecture is essential.

We will be covering in depth the implementation of string hashing, its analysis and its wide-spread application in many string-related questions.

String Hashing

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.

Suffix Arrays

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)

Sidhant Bansal

239 Followers

Free Classes

DP for OI - Problem Solving - Part 3

DP for OI - Problem Solving - Part 2

DP for OI - Problem Solving - Part 1

String Hashing

Suffix Arrays

Introduction to Biconnectivity