/**
* @param {string[]} strs
* @return {string}
*/
var longestCommonPrefix = function (strs) {
if (strs === undefined || strs.length === 0) return "";
return strs.reduce((prev, next) => {
var i = 0;
while (prev[i] && next[i] && prev[i] === next[i]) {
i++;
}
return prev.slice(0, i);
});
};