Finding the longest common substring in the array of strings.

longestCommonSubstring.js

let a = process.argv.slice(2);

String.prototype.strstr = function (search) {
    var position = this.indexOf(search);
    if (position == -1) {
        // not found
        return '';
    }

    return this.slice(position);
};

function longestCommonSubstring(words) {
    var wordsSorted = words.sort((a, b) => a.length - b.length);

    var longest_substring = []
    var shortest_string = wordsSorted.shift().split('');
    while (shortest_string.length) {
        longest_substring.unshift('');
        dance:
        for (i = 0; i < shortest_string.length; i++) {
            for (j = 0; j < wordsSorted.length; j++) {
                if (!wordsSorted[j].strstr(longest_substring[0] + shortest_string[i])) {
                    break dance;
                }

            }
            longest_substring[0] += shortest_string[i];
        }
        shortest_string.shift();
    }
    let sorted = longest_substring.sort((a, b) => a.length - b.length);
    return sorted.pop();

}

let res = longestCommonSubstring(a);

console.log(res);