0014. Longest Common Prefix.md

Write a function to find the longest common prefix string amongst an array of strings.

If there is no common prefix, return an empty string "".

/**
 * @param {string[]} strs
 * @return {string}
 */
var longestCommonPrefix = function(strs) {
    for(let i = 0; i < strs[0].length; i++) {
        for(let str of strs) {
            if(str[i] !== strs[0][i]) return str.slice(0, i);
        }
    }
    return strs[0];
};