Skip to content
Create a gist now

Instantly share code, notes, and snippets.

Embed URL


Subversion checkout URL

You can clone with
Download ZIP
function longestCommonPrefix(arr) {
var prefix = '';
var firstWord = arr[0];
function inAll(letter, idx) {
for(var j=0; j<arr.length; j++) {
if(arr[j][idx] != letter) return false;
return true;
for(var i=0; i<firstWord.length-1; i++) {
if(inAll(firstWord[i], i)) prefix += firstWord[i];
return prefix;
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Something went wrong with that request. Please try again.