ARTS-WEEK10

class Solution:
    def longestCommonPrefix(self, strs):
        if not strs:
            return ""
        return self.lcp(strs, 0, len(strs)-1)
    
    def lcp(self, strs, l, r):
        if l == r:
            return strs[l]
        
        mid = (l+r) // 2
        left = self.lcp(strs, l, mid)
        right = self.lcp(strs, mid+1, r)

        minlen = min(len(left), len(right))
        for i in range(minlen):
            if left[i] != right[i]:
                return left[:i]
        
        return left[:minlen]


"files.exclude": {
		"**/.git": true,
		"**/.svn": true,
		"**/.hg": true,
		"**/CVS": true,
		"**/.DS_Store": true
	},