Inspired by Michael Kohl's solution in F# (O(n) rules!), I did the same thing in Rust. All the credit to him :)
fn two_sum(ns: &[i32], sum: i32) -> Option<(usize, usize)> { let mut map = HashMap::new(); for (i, &n) in ns.iter().enumerate() { let diff = sum - n; if let Some(&j) = map.get(&diff) { return Some((j, i)); } map.insert(n, i); } None }
Are you sure you want to hide this comment? It will become hidden in your post, but will still be visible via the comment's permalink.
Hide child comments as well
Confirm
For further actions, you may consider blocking this person and/or reporting abuse
We're a place where coders share, stay up-to-date and grow their careers.
Inspired by Michael Kohl's solution in F# (O(n) rules!), I did the same thing in Rust. All the credit to him :)