minDistance = (word1, word2) => {
    const isEmpty = ((word1.length * word2.length) === 0);
    if (isEmpty) return (word1.length + word2.length);

    const tabu = initTabu(word1, word2);/* Time O(N * M) | Space O(N * M) */

    search(word1, word2, tabu);         /* Time O(N * M) | Space O(N * M) */

    return tabu[word1.length][word2.length];
}
DP - Bottom Up
Matrix - Tabulation
Time O(N * M) | Space O(N * M)
https://leetcode.com/problems/edit-distance/
@param {string} word1
@param {string} word2
@return {number}