Longest Common Prefix https://leetcode.com/problems/longest-common-prefix/
Linear Time in number of strings
- Longest common prefix will be the intersection between the minimum and maximum string.
- Maximum and Minimum can be obtained in one pass in linear time.
class Solution(object): def longestCommonPrefix(self, strs): """ :type strs: List[str] :rtype: str """ if len(strs) == 0: return "" else: s1, s2 = max(strs), min(strs) i, match = 0, 0 while i < len(s1) and i < len(s2) and s1[i] == s2[i]: i, match = i+1, match + 1 return s1[0:match]