Given two strings word1 and word2, return the minimum number of operations needed to transform word1 into word2.
The following three operations are allowed on any character of a word:
Insert a character
Delete a character
Replace a character
Constraints:
0≤ word1.length, word2.length ≤500
word1 and word2 consist of lowercase English letters
The key insight behind this problem is ...