SDE - Intern

You are given an array of integers ARR[] of size N consisting of zeros and ones. You have to select a subset and flip bits of that subset. You have to return the count of maximum one’s that you can obtain by flipping chosen sub-array at most once.

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.

One hundred students stand in line, one in front of the other, each wearing a black hat or a white hat. Every student can see the hats of their classmate in front but not their hats or those worn by anyone behind. The class teacher starts at the back of the line and asks each student the colour of their hat. If they answer correctly, they will pass the final exam. If they get it wrong, they’ll fail. How many students will pass at most if they are allowed to discuss a strategy before their teacher starts asking the colours of their hats?(Learn)

What is your favorite food?
Did you apply for any other company?
Why do you want to work here?
Do you have siblings?
What is your area of interest?
Do you have any questions?