Beats 100% time, somehow
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$$O(n^3)$$\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n$$O(n)$$\n\n# Code\n```\nclass Solution:\n    def ambiguousCoordinates(self, s: str) -> List[str]:\n        nums = s[1:-1]\n        \n        def eval_valid(s):\n            # print(f\'{s=}\')\n            if s[0] == \'0\':\n                if len(s) > 1:\n                    if s[-1] == \'0\':\n                        return set()\n                    else:\n                        return set([f\'0.{s[1:]}\'])\n                else:\n                    return set([\'0\'])\n            else:\n                produced = set([s])\n                \n\n                if s[-1] != \'0\':\n                    for i in range(1, len(s)):\n                        left = s[:i]\n                        right = s[i:]\n                        produced.add(left+\'.\'+right)\n                return produced\n\n        \n        res = []\n        \n        for i in range(1, len(nums)):\n            # print(i)\n            start, end = nums[:i], nums[i:]\n            # print(start, end)\n\n            left_produced = eval_valid(start)\n            right_produced = eval_valid(end)\n            for left_val in left_produced:\n                for right_val in right_produced:\n                    res.append(f\'({left_val}, {right_val})\')\n        return res\n```
['Python3']