edit-distance.js

/**
 * Source:  https://leetcode.com/problems/edit-distance/
 * Tags:    [Dynamic Programming,String]
 * Level:   Hard
 * Title:   Edit Distance
 * Auther:  @imcoddy
 * Content: Given two words word1 and word2, find the minimum number of steps required to convert word1 to word2. (each operation is counted as 1 step.)
 *
 *
 *
 * You have the following 3 operations permitted on a word:
 *
 *
 *
 * a) Insert a character
 * b) Delete a character
 * c) Replace a character
 *
 *
 *
 *                   Subscribe to see which companies asked this question
 *
 *
 *
 *
 *
 *
 *
 *
 *
 *
 *
 *
 *                   Show Similar Problems
 *
 *
 *                      (M) One Edit Distance
 */

/**
 * @param {string} word1
 * @param {string} word2
 * @return {number}
 */
var minDistance = function(word1, word2) {

};