Dynamic programming too easy

Basics :

Fibonacci number
Climbing stairs
Minimum jumps to reach the end
Friends pairing problem
Maximum subsequence sum such that no three are consecutive
0/1 Knapsack (Bounded)

Subset sum
Equal sum partition
Count of subsets sum with a given sum
Minimum subset sum difference
Count the number of subset with a given difference
Target sum
0/1 Knapsack (Unbounded)

Integer Break
Coin Change
Coin Change 2
Combination Sum IV
Perfect Squares
Longest increasing subsequence

Number of longest increasing subsequences
Longest non-decreasing subsequence
Find the longest increasing subsequence in circular manner
Longest bitonic subsequence
Longest arithmetic subsequence
Maximum sum increasing subsequence
Matrix Chain Multiplication

Burst Balloons
Evaluate expression to true / boolean parenthesization
Minimum or maximum value of a expression
Palindrome partitioning
Scramble string
Super Egg Drop
DP on Trees

Diameter of Binary Tree
Binary Tree Maximum Path Sum
Unique Binary Search Trees II
House Robber III
DP on Grid

Unique Paths
Unique Paths II
Minimum Path Sum
Dungeon Game
Cherry Pickup
DP on digits :

Number of Digit One
Non-negative Integers without Consecutive Ones
Numbers At Most N Given Digit Set
Numbers With Repeated Digits
Number of integers having sum divisible by k
Dp + Bitmask

Travelling salesman problem
Find minimum sum Hamiltonian Path
Task allotment to minimise the cost
Maximum Students Taking Exam
Find the Shortest Superstring
Minimum Number of Work Sessions to Finish the Tasks
Number of Ways to Wear Different Hats to Each Other

Comments (0)