func longestCommonPrefix(strs []string) string { for i := range strs[0] { char := strs[0][i] for _, str := range strs[1:] { if i >= len(str) || char != str[i] { return strs[0][:i] } } } return strs[0] } Complexity Time: O(S) — where S is length of all strings combined Space: O(1)