Skip to content

Practice Ambiguous Coordinates

Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.

Medium#816
LeetCode Problem

Ambiguous Coordinates

StringBacktrackingEnumeration

Problem Statement

We had some 2-dimensional coordinates, like "(1, 3)" or "(2, 0.5)". Then, we removed all commas, decimal points, and spaces and ended up with the string s. Return a list of strings representing all possibilities for what our original coordinates could have been. Our original representation never had extraneous zeroes, so we never started with numbers like "00", "0.0", "0.00", "1.0", "001", "00.01", or any other number that can be represented with fewer digits. Also, a decimal point within a number never occurs without at least one digit occurring before it, so we never started with numbers like ".1". The final answer list can be returned in any order. All coordinates in the final answer have exactly one space between them (occurring after the comma.)

Source: Ambiguous Coordinates on LeetCode. Use the original task for its coding environment and submissions.

Examples

# Example 1

Input
s = "(123)"
Output
["(1, 2.3)","(1, 23)","(1.2, 3)","(12, 3)"]

# Example 2

Input
s = "(0123)"
Output
["(0, 1.23)","(0, 12.3)","(0, 123)","(0.1, 2.3)","(0.1, 23)","(0.12, 3)"]

# Example 3

Input
s = "(00011)"
Output
["(0, 0.011)","(0.001, 1)"]

Constraints

4 <= s.length <= 12
s[0] == '(' and s[s.length - 1] == ')'.
The rest of s are digits.

Related LeetCode Problems

Practice more problems similar to Ambiguous Coordinates.

17 Letter Combinations of a Phone Number Medium22 Generate Parentheses Medium3 Longest Substring Without Repeating Characters Medium5 Longest Palindromic Substring Medium6 Zigzag Conversion Medium
← Previous Bus RoutesNext → Linked List Components

Review your practice with PhantomCodeAI

After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.

Start Free