Edit Distance
Problem statement
Given two strings word1 and word2, return the minimum number of single-character operations needed to transform word1 into word2.
The problem statement continues
ProExamples
Example 1
word1 = "horse"word2 = "ros"return = 3Replace h with r, delete the second r, and delete e.
FastPrep Pro
Reported in 1 Amazon interview this weekUnlock this recently reported problem
FastPrep Pro gives you full access to interview problems reported within the last week.
- Full problem statement and constraints
- 2 more worked examples, explained
- Guided hints and editorial
- Run your code on real test cases
$8.25/month
$99 billed yearly — or $19 month-to-month. Cancel anytime.
Free plan — 2 of 2 free unlocks used this week