Press "Enter" to skip to content

Posts tagged as “Dynamic Programming”

Longest common subsequence

Ajk 0

After my last DP problem, I thought I would try another one. In this problem we are asked to find the longest common subsequence of chars between two words. I…

Minimum edit distance

Ajk 0

Today I finally decided to write down a dynamic programming question. It’s very cliche and gets asked a lot in interviews. Given two words we want to find the minimum…