# time O(N) space O(1)
class Solution:
    def longestCommonPrefix(self, strs: List[str]) -> str:
        l = zip(*strs)
        res = ''
        for tup in l:
            if len(set(tup)) == 1:
                res += tup[0]
            else:
                break
        return res

Knowledge about zip zip([1,2,3],[4,5]) >> [([1,2,3]),([4,5,6])]