Legend

Master

Expert

Star

Rising Star

India

IIIT Hyderabad

IOI '15 Bronze Medallist

ICPC '20 World Finalist

Intern at Google

Intern at TIFR

Intern at ETH Zurich

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

50 minutes

Arjun P

In this class, we'll discuss Dynamic Programming-based solutions for two problems where you are given some types of tiles and you are asked to count the number of possible tilings of a space using these tiles

Competitive Programming

Session on Counting Tilings

Intermediate

Additional Concepts in C++

In this class we'll discuss the dynamic programming-based solution to the rod cutting problem and some variants of it. We'll look into which of these variants can be solved by using the same solution as the original problem, and for which of these this would not work due to the absence of the optimal substructure property.

Optimal Substructure: Examples and Non-examples

Dynamic Programming & Recursion

In this class, we will introduce two common search problems involving strings and discuss how to obtain solutions for them using dynamic programming.

Longest Increasing Subsequence and Longest Palindromic Subsequence

In this class, basic recursion-based counting techniques will be introduced, building on the familiar example of binomial coefficients to introduce other examples.

Counting Problems: Counting K-Subsets, Bracketings & Partitions

Free Classes

In this course, you'll learn about dynamic programming (DP), a fundamental technique in algorithm design. You'll be introduced to a variety of problems and how to solve them using DP. You'll learn when to recognize that a problem is amenable to a DP-based solution.

Course on Recursion and Dynamic Programming

Counting Bracketings and Optimal Matrix Multiplication

Plus