[Written explanation coming soon.]
AFFILIATE LINKS
Great resource I use to learn algorithms.
40% off Tech Interview Pro: http://techinterviewpro.com/terriblewhiteboard
20% off CoderPro: http://coderpro.com/terriblewhiteboard
Here is the full implementation.
/**
* @param {string[]} strs
* @return {string}
*/
let longestCommonPrefix = function(strs) {
let longest = '';
if (strs.length === 0) {
return longest;
}
let comparisonWord = strs[0];
let comparisonIndex = 0;
for (let comparisonLetter of comparisonWord) {
for (let i = 1; i < strs.length; i++) {
let currentWord = strs[i];
let currentLetter = currentWord.charAt(comparisonIndex);
if (comparisonIndex > currentWord.length || comparisonLetter !== currentLetter) {
return longest;
}
}
comparisonIndex++;
longest += comparisonLetter;
}
return longest;
};