LCS algorithm in JS. Prettified version of what can be found here: https://en.wikibooks.org/wiki/Algorithm_Implementation/Strings/Longest_common_subsequence#JavaScript

lcs.js

    // prettified version of what can be found here:
    // https://en.wikibooks.org/wiki/Algorithm_Implementation/Strings/Longest_common_subsequence#JavaScript
    function LCS(a, b) {
        var m = a.length,
            n = b.length,
            C = [],
            i,
            j;

        for (i = 0; i <= m; i++) C.push([0]);
        for (j = 0; j < n; j++) C[0].push(0);

        for (i = 0; i < m; i++) {
            for (j = 0; j < n; j++) {
                C[i+1][j+1] = a[i] === b[j]
                ? C[i][j]+1
                : Math.max(C[i+1][j], C[i][j+1]);
            }
        }

        C.forEach(
            function(c){
                console.log(c.map(
                    function(d){
                        return ('0'+d).slice(-2);
                    }
                ));
            }
        );

        return (function bt(i, j) {
            if (i * j === 0) {
                return '';
            }
            if (a[i-1] === b[j-1]) {
                let rtn =bt(i-1, j-1) + a[i-1];
                console.log(i,j,rtn);
                return rtn;
            }
            let rtn = (C[i][j-1] > C[i-1][j])
                    ? bt(i, j-1)
                    : bt(i-1, j);
            console.log(i,j,rtn);
            return rtn;
        }(m, n));
    }

    console.log(LCS('静岡大学情報学部', '岡山大学工学部'));