1089. Duplicate Zeros - https://leetcode.com/problems/duplicate-zeros/description/

duplicateZeros.java

class Solution {
    
    public void duplicateZeros(int[] arr) {

        for(int i = 0; i < arr.length; i++) {

            if(arr[i] == 0) {
                shiftRight(arr, i);
                i += 1;
            }
        }
    }
    
    public void shiftRight(int[] arr, int start) {
        
        for(int right = arr.length - 1; right > start; right--) {
            arr[right] = arr[right - 1];
        }
    }
}