Hide Index

Dynamic Programming

0% completed

Pattern: Linear DP

Calculate factorial

Nth fibonnaci number

Covering distance

Reachability check

Pattern: Coin change

Pattern: Longest common subsequence

Longest common subsequence

Longest common subsequence II

Pattern: Longest common subsequence (Variations)

Longest palindromic subsequence

Longest bitonic subsequence

Longest alternating subsequence

Pattern as subsequence

Shortest common supersequence

Pattern: Longest increasing subsequence

Longest increasing subsequence

Largest sum ascending subsequence

Pattern: Longest repeated subsequence

Longest repeated subsequence

Pattern: Longest common substring

Longest common substring

Pattern: Edit distance

Wildcard pattern matching

Interleaving Check

Pattern: Subset sum

Partition with equal sum

Sets with smallest discrepancy

Pattern: 2D Grid

Longest ascending route

Largest square area

Destination path count

Largest plus of 1’s

Pattern: Optimal stratergy

Optimal game strategy

Pattern: Knapsack

Zero one knapsack

Zero one Knapsack II

Pattern: Boolean parenthesization

Boolean parenthesization

Pattern: Matrix chain multiplication

Matrix chain multiplication

Pattern: String partitioning

Minimum partitioning

Pattern: Prefix sum

K limited submatrix sum

Maximum submatrix sum

Design a range sum finder

Assessments

Certificate

Liking the course? Check our discounted plans to continue learning.