Rust, my best shot at performance (checked with benchmarks):
pub fn move_zeros_to_end_deque(nums: &[i32]) -> VecDeque<i32> { let mut deque = VecDeque::with_capacity(nums.len()); for &n in nums.into_iter().rev() { if n == 0 { deque.push_back(n); } else { deque.push_front(n); } } deque }
did u try the given array in ur solution?
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, my best shot at performance (checked with benchmarks):
did u try the given array in ur solution?