Rust solution:
use std::collections::HashSet; fn two_add_upto(list: &[i32], k: i32) -> bool { let mut set = HashSet::with_capacity(list.len()); for i in list.iter() { let diff = k - i; if set.contains(&diff) { return true; } set.insert(i); } false }
Made a sized Set to overcome the reallocation and copying of data. This increases the Size requirement to O(N).
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.
Rust solution:
Made a sized Set to overcome the reallocation and copying of data. This increases the Size requirement to O(N).