As part of Data Structures and Algorithms implementation using Rust, today we will explore `Duplicate Zeros`

problem.

Leetcode problem link: https://leetcode.com/problems/duplicate-zeros/

###### Problem Statement

```
Given a fixed length array arr of integers, duplicate each occurrence of zero, shifting the remaining elements to the right
```

###### Instructions

```
Note that elements beyond the length of the original array are not written.
Do the above modifications to the input array in place, do not return anything from your function.
Example 1:
Input: [1,0,2,3,0,4,5,0]
Output: null
Explanation: After calling your function, the input array is modified to: [1,0,0,2,3,0,0,4]
Example 2:
Input: [1,2,3]
Output: null
Explanation: After calling your function, the input array is modified to: [1,2,3]
Note:
1 <= arr.length <= 10000
0 <= arr[i] <= 9
```

###### Solution

Here is my solution to above problem

```
impl Solution {
pub fn duplicate_zeros(arr: &mut Vec<i32>) {
let mut n = 0;
while n < arr.len() {
let t = arr[n];
if t == 0 {
arr.pop();
arr.insert(n, 0);
n += 2;
} else {
n += 1;
}
}
}
}
```

Please feel free to share your comments.

Happy reading!!!

## Discussion (0)