#816
Medium Algorithms Ambiguous coordinates
String Backtracking Enumeration
56.5% acceptance
Feb 22, 2026
340
668
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.
For example, "(1, 3)" becomes s = "(13)" and "(2, 0.5)" becomes s = "(205)".
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.)
Solution
Rust
Time O(n³)
Space O(n)
/*
* 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.
* For example, "(1, 3)" becomes s = "(13)" and "(2, 0.5)" becomes s = "(205)".
* 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.)
* 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)"]
* Explanation: 0.0, 00, 0001 or 00.01 are not allowed.
* 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.
*/
impl Solution {
pub fn ambiguous_coordinates(s: String) -> Vec<String> {
let s = &s[1..s.len()-1]; // remove parens
let mut res = vec![];
fn valid_num(s: &str) -> Vec<String> {
let mut v = vec![];
// integer part: no leading zero unless single digit
// try placing decimal after position i (0 = no decimal = integer)
let n = s.len();
for d in 0..=n {
let int_part = &s[..n-d];
let dec_part = &s[n-d..];
if int_part.is_empty() { continue; }
if int_part.len() > 1 && int_part.starts_with('0') { continue; }
if d == 0 {
v.push(int_part.to_string());
} else {
if dec_part.ends_with('0') { continue; }
v.push(format!("{}.{}", int_part, dec_part));
}
}
v
}
for i in 1..s.len() {
let left = valid_num(&s[..i]);
let right = valid_num(&s[i..]);
for l in &left {
for r in &right {
res.push(format!("({}, {})", l, r));
}
}
}
res
}
}