FREE Course on Dynamic Programming for Olympiad of Informatics

DP for OI - Problem Solving - Part 1

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.

Dec 15, 2020 • 2h 0m

Sidhant Bansal

DP for OI - Problem Solving - Part 2

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.

Dec 17, 2020 • 2h 0m

Sidhant Bansal

DP for OI - Problem Solving - Part 3

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.

Dec 19, 2020 • 2h 0m

Sidhant Bansal