#Problem
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:

1
2
3
Input: strs = ["flower","flow","flight"]
Output: "fl"

Example 2:

1
2
3
Input: strs = ["dog","racecar","car"]
Output: ""
Explanation: There is no common prefix among the input strings.

Solve

1
2
3
4
5
6
7
8
9
10
11
12
13
14
class Solution:
    def longestCommonPrefix(self, strs: List[str]) -> str:
        pref = ''
        
        i = 0
        minWord = min(strs, key=len)

        while i < len(minWord):
            for word in strs:
                if word[i] != minWord[i]:
                    return pref
            pref += minWord[i]
            i += 1
        return pref