VMWare Inc Interview Question
- 0of 0 votes
You are given a binary array with N elements: d, d, ... d[N - 1].- kesar January 02, 2014 in United States
You can perform AT MOST one move on the array: choose any two integers [L, R], and flip all the elements between (and including) the L-th and R-th bits. L and R represent the left-most and right-most index of the bits marking the boundaries of the segment which you have decided to flip.
What is the maximum number of '1'-bits (indicated by S) which you can obtain in the final bit-string?
'Flipping' a bit means, that a 0 is transformed to a 1 and a 1 is transformed to a 0 (0->1,1->0).
An integer N
Next line contains the N bits, separated by spaces: d d ... d[N - 1]
1 <= N <= 100000
d[i] can only be 0 or 1f
0 <= L <= R < n
1 0 0 1 0 0 1 0
We can get a maximum of 6 ones in the given binary array by performing either of the following operations:
Flip [1, 5] ==> 1 1 1 0 1 1 1 0
| Report Duplicate | Flag | PURGE
VMWare Inc Problem Solving
Interview Type: Written Test
Open Chat in New Window