Minimum Delete Operations of Two Strings

# Introduction In this challenge, you will write a function called `minDistance` that receives two words and calculates the minimum number of steps needed to transform the two words into the same one. Each step consists of removing a single character from either word. For instance, if "sea" and "eat" are the inputs, the output must be 2, because it would take two steps to turn both words into "ea".

|60 : 00

Click the virtual machine below to start practicing