Longest Common Prefix

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: strs = [“flower”,“flow”,“flight”]
Output: “fl”

Example 2:

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

Constraints:

• 1 <= strs.length <= 200
• 0 <= strs[i].length <= 200
• strs[i] consists of only lowercase English letters if it is non-empty.

My Answer

from typing import List
class Solution:
    def longestCommonPrefix(self, strs: List[str]) -> str:
        common = ''
        for char in strs[0]:
            for word in strs:
                if not word.startswith(common+char):
                    return common
            common+= char
        return common

LeetCode - The World’s Leading Programming Learning Platform
technical interview