longestCommonSubsequence = (text1, text2) => {
    const tabu = initTabu(text1, text2);/* Time O(N * M) | Space O(N * M) */

    search(text1, text2, tabu);         /* Time O(N * M) | Space O(N * M) */

    return tabu[0][0];
}
DP - Bottom Up
Matrix - Tabulation
Time O(N * M) | Space O(N * M)
https://leetcode.com/problems/longest-common-subsequence/
@param {string} text1
@param {string} text2
@return {number}