Edit Distance · Compound Engineer

Edit Distance

Find the fewest insert, delete and replace operations that turn one word into another. Fill a table where each cell is the best cost for a pair of prefixes, built from its left, top and diagonal neighbours.

DSAProHardStep-through playerBy Aayush OstwalSolve on LeetCode ↗
Spotted a mistake in this lesson?Report an issue →