LeetCode 14 - Longest Common Prefix Problem

Problem Statement

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:

class Solution: def longestCommonPrefix(self, strs: List[str]) -> str: if not strs: return "" prefix = strs[0] for i in range(1, len(strs)): while prefix!=strs[i][:len(prefix)]: prefix = prefix[:len(prefix)-1] if len(prefix)==0: break return prefix