Given a binary array, we can flip all the 1 are in the left part and all the 0 to the right part.Calculate the minimum flips required to make all 1s in left and all 0s in right.
Input: 1011000 Output: 1 1 flip is required to make it 1111000. Input : 00001 Output : 2 2 flips required to make it 10000.
For solving this problem we use bitmasking. First, we convert this array to string, then we find the equivalent decimal number of that binary string. We try all masks with all possibilities of 1s in left and 0s in right. We iterate a loop till decimal number becomes zero. Each time we will do bitwise XOR of the number with mask and number of ones in XOR value will be the number of flips required. We decrease n by 1 and update the mask.
1-Take binary array as input
2-Convert array to string and then equivalent decimal number(num)
3-Take initial mask value and iterate till num <= 0
4-Find required flips using (num XOR mask)
5-Find minimum flips and decrease num and update mask
6-Return the minimum count
- Minimum flips to make all 1s in left and 0s in right | Set 2
- Count minimum right flips to set all values in an array
- Minimum flips in two binary arrays so that their XOR is equal to another array
- Minimum flips required to maximize a number with k set bits
- Minimum element left from the array after performing given operations
- Find the minimum number of rectangles left after inserting one into another
- Minimum removals to make array sum even
- Minimum operations to make the MEX of the given set equal to x
- Minimum removals to make array sum odd
- Minimum removals from array to make max - min <= K
- Minimum operations to make XOR of array zero
- Minimum swaps to make two arrays identical
- Minimum array element changes to make its elements 1 to N
- Minimum gcd operations to make all array elements one
- Minimum insertions to make a Co-prime array
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to firstname.lastname@example.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.
Improved By : prateek dhawalia