Longest Common Subsequence (Javascript

longest_common_subsequence.js

module.exports = { 
 //param A : string
 //param B : string
 //return an integer
	solve : function(A, B){
        let rows = A.length, cols = B.length;
        let lcs = Array.from({ length: rows + 1 }, () => Array.from({ length: cols + 1 }).fill(0));
        
        for (let i=1;i<=rows;i++) {
            for (let j=1;j<=cols;j++) {
                if (A[i-1] === B[j-1]) {
                    lcs[i][j] = lcs[i-1][j-1] + 1;
                } else {
                    lcs[i][j] = Math.max(lcs[i-1][j], lcs[i][j-1]);
                }
            }
        }
        
        return lcs[rows][cols];
	}
};