RezloPrep

Interview PrepDynamic Programming

0% read · 0 of 56 topics

Dynamic ProgrammingDSA

Optimization & State

0% read0 of 56 topics

1. 1D DP0/6

Climbing StairsSoon

Frog JumpSoon

Frog Jump with K DistancesSoon

Maximum Sum of Non-Adjacent ElementsSoon

House RobberSoon

House Robber IISoon

2. 2D / Grid DP0/8

Ninja's TrainingSoon

Unique PathsSoon

Unique Paths IISoon

Minimum Path SumSoon

Minimum Path Sum in Triangular GridSoon

Minimum Falling Path SumSoon

Minimum/Maximum Falling Path Sum with Variable Starting PointSoon

Cherry Pickup IISoon

3. Subsequence DP0/10

Subset Sum Equal to KSoon

Partition Equal Subset SumSoon

Count Subsets with Sum KSoon

Count Partitions with Given DifferenceSoon

0/1 KnapsackSoon

Minimum CoinsSoon

Target SumSoon

Coin ChangeSoon

Coin Change IISoon

Unbounded KnapsackSoon

4. String DP0/10

Print Longest Common SubsequenceSoon

Longest Common SubstringSoon

Minimum Insertions to Make String PalindromeSoon

Minimum Insertions/Deletions to Convert StringSoon

Shortest Common SupersequenceSoon

Wildcard MatchingSoon

Longest Common SubsequenceSoon

Longest Palindromic SubsequenceSoon

Distinct SubsequencesSoon

Edit DistanceSoon

5. Stock DP0/6

Best Time to Buy and Sell Stock10 min Best Time to Buy and Sell Stock II10 min

Best Time to Buy and Sell Stock IIISoon

Best Time to Buy and Sell Stock IVSoon

Best Time to Buy and Sell Stock with Transaction FeeSoon

Best Time to Buy and Sell Stock with CooldownSoon

6. LIS DP0/7

Longest Increasing SubsequenceSoon

Print Longest Increasing SubsequenceSoon

Longest Increasing Subsequence — Binary SearchSoon

Largest Divisible SubsetSoon

Longest String ChainSoon

Longest Bitonic SubsequenceSoon

Number of Longest Increasing SubsequencesSoon

7. Partition DP0/6

Matrix Chain MultiplicationSoon

Minimum Cost to Cut a StickSoon

Burst BalloonsSoon

Boolean ParenthesizationSoon

Palindrome Partitioning IISoon

Partition Array for Maximum SumSoon

8. DP on Rectangles0/3

Maximum Rectangle Area with All 1sSoon

Count Square Submatrices with All 1sSoon

Maximal Rectangle / Histogram-based DPSoon

Climbing Stairs

This lesson is coming soon. Browse the rest of the Dynamic Programming syllabus in the sidebar.