Scribd
Upload
171 views2 pages

Essential DP Problems for Learners

The document provides a list of 26 dynamic programming problems labeled A through Z covering various concepts and difficulty levels. It includes the problem name, link, and relevant concepts for each problem. The problems cover topics like bottom-up DP, 2D DP, classical knapsack problems, longest common subsequence, graph problems, grid problems, probability DP, games, and more. It aims to provide a comprehensive set of problems to learn and practice different dynamic programming techniques.

Uploaded by

Alfredo L Watson
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
171 views2 pages

Essential DP Problems for Learners

The document provides a list of 26 dynamic programming problems labeled A through Z covering various concepts and difficulty levels. It includes the problem name, link, and relevant concepts for each problem. The problems cover topics like bottom-up DP, 2D DP, classical knapsack problems, longest common subsequence, graph problems, grid problems, probability DP, games, and more. It aims to provide a comprehensive set of problems to learn and practice different dynamic programming techniques.

Uploaded by

Alfredo L Watson
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

 

Dynamic Programming Problem Set  


Must Do DP Problems covering all DP Concepts and difficulty levels. 
 
[ If you have less time, want to get a taste of different types of DP, checkout the AtCoder 
Problem Section in the course end of Dynamic Programming Master Course] 

Code Problem Link Concepts | Problem Tags

A Frog 1 Bottom-up DP

B Frog 2 Bottom-up DP, 2D DP

C Vacation Bottom-up DP, 2D DP

D Knapsack 1 Classical DP

E Knapsack 2 Bottom-up DP, 2D DP, Variation of classical DP

F LCS Classical DP, Top-down DP

G Longest Path DP on Graphs

H Grid 1 Grid DP, 2D DP

I Coins Probability DP, 2D DP

J Sushi Probability, Expected value DP, math

K Stones  Game Theory, DP

L Deque Multidimensional DP, Game theory

M Candies  Multidimensional DP and DP optimizations, Prefix sums

N Slimes DP on intervals

O Matching  DP with bitmasking

P Independent Set  DP on trees


Q Flowers DP, DP optimization, segment tree, maps

R Walk  DP on graphs, Matrix exponentiation

S Digit Sum Digit DP, Modular arithmetic

T Permutation  Multidimensional DP, DP Optimizations, Prefix and Suffix


sums

U Grouping  DP with Bitmasking, Bit Masking concepts and Bit


manipulation

V Subtree  DP on trees, Optimization with Prefix and Suffix arrays

W Intervals  DP optimization, Segment tree, Lazy propagation

X Tower  Exchange Argument DP, Sorting

Y Grid 2  Grid DP, Math, Combinatorics, Modular arithmetic,


Implementation

Z Frog 3  DP optimization using Convex Hull Trick, Introduction to


Convex Hull Trick, math

Contest Link
Tasks - Educational DP Contest

You might also like