TS Solution
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n\n# Complexity\n- Time 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nfunction ambiguousCoordinates(s: string): string[] {\n    const res: string[] = [];\n    const s2: string = s.substr(1, s.length - 2);\n    const n: number = s2.length;\n    \n    for (let i = 1; i < n; i++) {\n        const first: string[] = getNumbers(s2.substr(0, i));\n        const second: string[] = getNumbers(s2.substr(i));\n        \n        for (let j = 0; j < first.length; j++) {\n            for (let k = 0; k < second.length; k++) {\n                res.push("(" + first[j] + ", " + second[k] + ")");\n            }\n        }\n    }\n    return res;\n}\n\nfunction getNumbers(num: string): string[] {\n    const res: string[] = [];\n    const n: number = num.length;\n    \n    if (n == 1) \n        return [num];\n    \n    if (num[0] != \'0\') \n        res.push(num);\n    \n    if (num[0] == \'0\') {\n        if (num[num.length - 1] == \'0\') return [];\n        return ["0." + num.substr(1)];\n    }\n    \n    for (let i = 1; i < n; i++) {\n        if (num.substr(i).substr(-1) == \'0\') continue;\n        res.push(num.substr(0, i) + "." + num.substr(i));\n    }\n    \n    return res;\n}\n```
['TypeScript']