New update is available. Click here to update.

# Flip Bits

Contributed by
Nishant Chitkara
Last Updated: 23 Feb, 2023
Easy
0/40
Avg time to solve 15 mins
Success Rate 85 %
Share
321 upvotes

## Problem Statement

#### A flip operation is one in which you turn 1 into 0 and 0 into 1.

##### For example:
If you are given an array {1, 1, 0, 0, 1} then you will have to return the count of maximum one’s you can obtain by flipping anyone chosen sub-array at most once, so here you will clearly choose sub-array from the index 2 to 3 and then flip it's bits. So, the final array comes out to be {1, 1, 1, 1, 1} which contains five ones and so you will return 5.
Detailed explanation ( Input/output format, Notes, Images )
##### Constraints:
1 <= T = 100
1 <= N <= 10^4
0 <= ARR[i] <= 1

Time Limit: 1 sec
3
5
1 0 0 1 0
4
1 1 1 0
5
0 0 1 0 0
4
4
4
##### Explanation For Sample Input 1:
For the first test case:
We can perform a flip operation in the range [1,2]. After the flip operation, the array is: 1 1 1 1 0
and so the answer will be 4

Similarly, in the second test case :
We can perform a flip operation in the range [3,3]. After the flip operation, the array is: 1 1 1 1
and so the answer will be 4.

Finally for the third test case :
We can perform a flip operation in the range [0,4]
After the flip operation, the array is: 1 1 0 1 1
and so the answer will be 4
3
5
0 0 0 0 0
5
1 1 1 1 1
8
1 0 1 0 1 0 1 0
5
5
5
Auto
Console