Hide Index

Dynamic Programming

0% completed

Pattern: Linear DP

Calculate factorial

Nth fibonnaci number

Coin change

Longest common subsequence

Longest common subsequence

Longest common subsequence II

Longest increasing subsequence

Longest increasing subsequence

Largest sum ascending subsequence

Longest common substring

Longest common substring

Edit distance

Subset sum

Optimal stratergy

Optimal game strategy

Knapsack

Zero one knapsack

Zero one Knapsack II

Boolean parenthesization

Boolean parenthesization

Matrix chain multiplication

Matrix chain multiplication

Word break

Pattern: Edit distance

Wildcard pattern matching

Interleaving Check

Pattern: Subset sum

Partition with equal sum

Sets with smallest discrepancy

Pattern: Word break

Minimum partitioning

Pattern: 2D Grid

Longest ascending route

Largest square area

Destination path count

Largest plus of 1’s

Pattern: Prefix sum

K limited submatrix sum

Maximum submatrix sum

Design a range sum finder

Practise

Covering distance

Reachability check

Longest palindromic subsequence

Longest bitonic subsequence

Longest alternating subsequence

Pattern as subsequence

Shortest common supersequence

Longest repeated subsequence

Assessments

Certificate

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