We have a bit array like below
{1 0 1 0 0 1 0 1}
Number of bits in above array is 8
If we take range from [1,5] then number of bits in [1,5] range is [0 1 0 0 1].
If we flip this range then after flipping it will be [ 1 0 1 1 0]
So total number of 1's after flipping [1,5] range is [1 1 0 1 1 ...
@DroidDev For the given example in the question, the output range should be [1,6] and hence the result will be 6. However when you'll run the example code which is in the answer it returns range [1,4] and output 6.
@TheLittleNaruto duuuuude, you know how the flipping range in question is defined. Everything in that range will be flipped. 0s will be flipped to 1s and 1s will be flipped to 0s. Try thisBAAKA!!
@Shadow Where will "locked question Q?A posts rep" will go ?
> locked by Tim Post♦ May 19 '13 at 5:53 This question exists because it has historical significance, but it is not considered a good, on-topic question for this site, so please do not use it as evidence that you can ask similar questions here. This question and its answers are frozen and cannot be changed. More info: help center.
One of the most popular questions on Stack Overflow, What's your best programming joke? has recently been deleted. Why was this done, rather than migrated to programmers.SE? Does this not fall into the broad purview of Programmery questions, or is it really off topic?
I'm somewhat neutral on th...
> Female software engineers become sexually irresistible at the age of consent, and remain that way until about thirty minutes after clinical death. Longer if it's a warm day.
Fuck, I am laughing so hard on this, but with my lips closed
QA girl sitting next to me is just looking at me weirdly, and I can't even share this joke with her
I had an interesting job interview experience a while back. The question started really easy:
Q1: We have a bag containing numbers 1, 2, 3, …, 100. Each number appears exactly once, so there are 100 numbers. Now one number is randomly picked out of the bag. Find the missing number.
I've hea...
@TheLittleNaruto well...I am solving a problem on interviewbit rn. I would really appreciate if you also started doing some DS and algo practice in your free time :P
@TheLittleNaruto first I solved the one which we were discussing earlier (with some online help of-course). Now I am solving another one, which was asked in google. But, its pretty easy. I think the catch will be in reducing space complexity. Anyway, here's the link: interviewbit.com/problems/max-non-negative-subarray
yeah, but you don't read questions properly. And that's from google, there were 4 edge cases that I noticed during solving process, and I missed two of them.
In english, that quote will roughly translate to, "There's definitely something, because of which we are still around. Even when since long time, whole world has been trying to finish us"
@ShadowWizard lol, no. It actually refers to how since like more than 2000 years, people have kept attacking the gates of India, and since then we have kept defending, and are still thriving.
We have a bit array like below
{1 0 1 0 0 1 0 1}
Number of bits in above array is 8
If we take range from [1,5] then number of bits in [1,5] range is [0 1 0 0 1].
If we flip this range then after flipping it will be [ 1 0 1 1 0]
So total number of 1's after flipping [1,5] range is [1 1 0 1 1 ...
What is the best comment in source code you have ever encountered?
This seems to stop morons from messing my code...
// Autogenerated, do not edit. All changes will be undone.
I had an interesting job interview experience a while back. The question started really easy:
Q1: We have a bag containing numbers 1, 2, 3, …, 100. Each number appears exactly once, so there are 100 numbers. Now one number is randomly picked out of the bag. Find the missing number.
I've hea...
