Short Go Solution
\nimport "fmt"\n\nfunc ambiguousCoordinates(s string) []string {\n\tresults := []string{}\n\ts = s[1 : len(s)-1]\n\tfor c := 1; c < len(s); c++ {\n\t\tp2s := am
```\nimport "fmt"\n\nfunc ambiguousCoordinates(s string) []string {\n\tresults := []string{}\n\ts = s[1 : len(s)-1]\n\tfor c := 1; c < len(s); c++ {\n\t\tp2s := ambiguousNumber(s[c:])\n\t\tfor _, p1 := range ambiguousNumber(s[:c]) {\n\t\t\tfor _, p2 := range p2s {\n\t\t\t\tresults = append(results, fmt.Sprintf("(%s, %s)", p1, p2))\n\t\t\t}\n\t\t}\n\t}\n\treturn results\n}\n\nfunc ambiguousNumber(s string) []string {\n    results := []string{}\n\tif len(s) == 1  || s[0] != \'0\' {\n\t\tresults = append(results, s)\n\t}\n\tfor c := 1; c < len(s); c++ {\n\t\tp1, p2 := s[:c], s[c:]\n\t\tif p2[len(p2)-1] == \'0\' || (p1[0] == \'0\' && len(p1) > 1) {\n\t\t\tcontinue\n\t\t}\n\t\tresults = append(results, fmt.Sprintf("%s.%s", p1, p2))\n\t}\n\treturn results\n}\n\n```
['Go']