Home Blog Past IEEEXtreme Challenges Posts on IEEEXtreme 14.0
Dynamic Programming · Edit Distance
5 min read
This problem can be solved using Dynamic Programming. The idea is to find the optimal alignment of two strings (i.e. edit distance) that maximizes the cost of the alignment.