Solution in C++
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```\nclass Solution {\npublic:\n    vector<string> cases(string &&s)\n     {\n    if (s.size() == 1) \n        return {s};\n    if (s.front() == \'0\') \n    { \n        if (s.back() == \'0\') \n            return\n             {\n\n             };\n        return {"0." + s.substr(1)}; \n    }\n    if (s.back() == \'0\') \n        return \n        {\n            s\n            };\n    vector<string> res\n    {\n        s\n        }; \n    for (int i = 1; i < s.size(); i++)\n        res.emplace_back(s.substr(0, i) + "." + s.substr(i));\n    return res;\n}\nvector<string> ambiguousCoordinates(string S)\n {\n    vector<string> res;\n    for (int i = 2; i < S.size() - 1; i++) \n    for (auto &x : cases(S.substr(1, i - 1)))\n    for (auto &y : cases(S.substr(i, S.size() - i - 1)))\n        res.emplace_back("(" + x + ", " + y + ")");\n    return res;\n    }\n};\n```
['C++']