Easy clean Go solution. Beats 100%
\nfunc ambiguousCoordinates(s string) []string {\n\tvar result []string\n\n\tfor i := 2; i <= len(s)-2; i++ {\n\t\tleft, right := s[1:i], s[i:len(s)-1]\n\n\t\ti
```\nfunc ambiguousCoordinates(s string) []string {\n\tvar result []string\n\n\tfor i := 2; i <= len(s)-2; i++ {\n\t\tleft, right := s[1:i], s[i:len(s)-1]\n\n\t\tif isLegalPart(left) && isLegalPart(right) {\n\t\t\tleftPartitions, rightPartitions := getAllPartitions(left), getAllPartitions(right)\n\n\t\t\tfor _, leftPartition := range leftPartitions {\n\t\t\t\tfor _, rightPartition := range rightPartitions {\n\t\t\t\t\tresult = append(result, fmt.Sprintf("(%s, %s)", leftPartition, rightPartition))\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\treturn result\n}\n\nfunc isLegalPart(s string) bool {\n\treturn len(s) == 1 || s[0] != \'0\' || s[len(s)-1] != \'0\'\n}\n\nfunc getAllPartitions(s string) []string {\n\tswitch {\n\tcase len(s) == 1 || s[len(s)-1] == \'0\':\n\t\treturn []string{s}\n\tcase s[0] == \'0\':\n\t\treturn []string{fmt.Sprintf("0.%s", s[1:])}\n\tdefault:\n\t\tresult := make([]string, 1, len(s))\n\t\tresult[0] = s\n\t\tfor i := 1; i < len(s); i++ {\n\t\t\tresult = append(result, fmt.Sprintf("%s.%s", s[:i], s[i:]))\n\t\t}\n\t\treturn result\n\t}\n}\n```
['Go']