Dynamic Programming

Memoization, tabulation, knapsack, LCS.

Log in to read this chapter

This chapter is part of Placements — DSA & Coding. Log in to continue reading the full lessons, notes and practice.

What you'll learn in this chapter

Introduction to DP — Memoization and Tabulation

1D DP (Fibonacci, Climbing Stairs, House Robber)

Knapsack Pattern (0/1 and Unbounded)

Subsequence DP (LIS and LCS)

Grid DP (Unique Paths, Min Path Sum)

String DP (Edit Distance, Palindromes)

Partition and Interval DP

DP on Trees and Bitmask DP