longestCommonPrefix.go

import "strings"

// strs := []string{"flower", "flow", "flight"} -> fl
// strs := []string{"c", "acc", "ccc"} -> ""

func longestCommonPrefix(strs []string) string {
    if len(strs) < 1 {
        return ""
    }
    prefix := strs[0]

    for i := 1; i < len(strs); i++ {
		    nStr := strs[i]
		    for len(prefix) > 0 && strings.Index(nStr, prefix) != 0 {
			      prefix = prefix[:len(prefix)-1]
		    }
	  }

	return prefix
}