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 “".

Example 1:

Input: [“flower”,“flow”,“flight”] Output: “fl”

Example 2:

Input: [“dog”,“racecar”,“car”] Output: "” Explanation: There is no common prefix among the input strings.

Note:

All given inputs are in lowercase letters a-z.

Solution

function longestCommonPrefix(arr) {
  if (arr.length === 0) return ''
  for (let i=0;i<arr[0].length;i++){
    for (let item of arr){
      if(item[i]!==arr[0][i]) return item.slice(0, i)
    }
  }  
}