Given an array arr[] containing N integers. In one step, any element of the array can either be changed by +1,-1,0. Find the minimum number of steps required such that the final product of all modified elements in the array is 1.

Question

Accepted Answer

Find minimum steps to make product of array equal to 1 by changing elements by +1,-1,0.

Calculate number of negative elements and number of zeroes in array.
If number of negative elements is even, add 1 to all elements.
If number of negative elements is odd, add 1 to all elements except the smallest negative element.
Count the number of steps taken to modify the array elements.
Return the count of steps taken.