We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
I’ll try to explain this to my understanding and capacity.
S – Set of numbers from 1 to N [Eg: 1,2,3…N]
N – The last number in the set
K – Threshold number [i.e limit for the answer to be obtained] and this value can be K <= N
Since our answer should be < K, the possible answer would be <= K-1.
We know that while doing an AND operation between 2 numbers, the answer would be <= LOWEST NUMBER of those 2 numbers. And we need to find this LOWEST NUMBER which is <= K-1
So we need to find an AND pair which would result with our required answer.
STEP 1: Since K-1 is the highest possible answer, we will take it as one of the 2 numbers. The other number should be > K-1 due to the AND property and it would be >= K. It’s best to take a number whose binary equivalent is similar to K-1’s binary value. So K would be the best choice.
Note: By doing an OR operation between 2 numbers, the answer would be >= HIGHEST NUMBER of the 2 numbers.
STEP 2: To find the other number we perform OR operation between the highest possible answer and the immediate larger number to it.
i.e [(K-1) OR (K-1)+1] which is nothing but [(K-1) OR K] and its result would be >= K.
STEP 3: Now we got the AND pair which are K-1 and K (minimum possible result of the above OR operation) and our AND result would be <= K-1.
For most cases we will get the final answer as K-1 itself but not for all cases.
a) When K is odd, the final answer will definitely be K-1 because if K is odd, K-1 will be even. Here only the LSB of the binary equivalent will be different. Eg: K=5(0101) ; K-1=4(0100)
b) When K is even, K-1 will be odd and both number's binary values might not be similar. Eg: K=8(1000) ; K-1=7(0111)
c) K-1 will be the answer only when the result of OR operation is <= N. If its > N, we would end up using a number which is not in the given number set for the AND operation which might result in a wrong final answer.
So these cases occur when {(K-1 OR K) > N} and when K is even.
For these scenarios, the highest possible answer would not be K-1 and it'll be the next lesser number K-2.
The AND pairs for such scenarios would be K-2 and K-1 resulting with a final answer K-2.
For the above cases, K-1 cannot be the highest possible answer so we take next the lesser number K-2 as the highest possible answer and we start again from STEP 1 replacing K-1 with K-2 and K with K-1.
Thanks for the detailed explaination, rospvar. I was able to implement this in Java and get test case 5 to pass in addition to 0 and 1 but cases 2, 3, and 4 still fail for me. The method below is the implementation which is given a score of 7.5. What I don't understand is why I get the correct answers for the other tests in my IDE but they won't pass on HackerRank. If there is a max time then, why doesn't HackerRank identify that as a requirement?
Day 29: Bitwise AND
You are viewing a single comment's thread. Return to all comments →
I’ll try to explain this to my understanding and capacity.
S – Set of numbers from 1 to N [Eg: 1,2,3…N]
N – The last number in the set
K – Threshold number [i.e limit for the answer to be obtained] and this value can be K <= N
Since our answer should be < K, the possible answer would be <= K-1.
We know that while doing an AND operation between 2 numbers, the answer would be <= LOWEST NUMBER of those 2 numbers. And we need to find this LOWEST NUMBER which is <= K-1
So we need to find an AND pair which would result with our required answer.
STEP 1: Since K-1 is the highest possible answer, we will take it as one of the 2 numbers. The other number should be > K-1 due to the AND property and it would be >= K. It’s best to take a number whose binary equivalent is similar to K-1’s binary value. So K would be the best choice.
Note: By doing an OR operation between 2 numbers, the answer would be >= HIGHEST NUMBER of the 2 numbers.
STEP 2: To find the other number we perform OR operation between the highest possible answer and the immediate larger number to it.
i.e [(K-1) OR (K-1)+1] which is nothing but [(K-1) OR K] and its result would be >= K.
STEP 3: Now we got the AND pair which are K-1 and K (minimum possible result of the above OR operation) and our AND result would be <= K-1.
For most cases we will get the final answer as K-1 itself but not for all cases.
a) When K is odd, the final answer will definitely be K-1 because if K is odd, K-1 will be even. Here only the LSB of the binary equivalent will be different. Eg: K=5(0101) ; K-1=4(0100)
b) When K is even, K-1 will be odd and both number's binary values might not be similar. Eg: K=8(1000) ; K-1=7(0111)
c) K-1 will be the answer only when the result of OR operation is <= N. If its > N, we would end up using a number which is not in the given number set for the AND operation which might result in a wrong final answer.
So these cases occur when {(K-1 OR K) > N} and when K is even.
For these scenarios, the highest possible answer would not be K-1 and it'll be the next lesser number K-2. The AND pairs for such scenarios would be K-2 and K-1 resulting with a final answer K-2.
For the above cases, K-1 cannot be the highest possible answer so we take next the lesser number K-2 as the highest possible answer and we start again from STEP 1 replacing K-1 with K-2 and K with K-1.
Really precise explanation. Thanks a lot!
thanks a lot . it helped me a lot
Awsm.
Amazing explaination!!!!
Hello @rospvar, This is a beautifull explanation. Anyway I could able to understand after trying some handson in the problem. :)
Thanks for the detailed explaination, rospvar. I was able to implement this in Java and get test case 5 to pass in addition to 0 and 1 but cases 2, 3, and 4 still fail for me. The method below is the implementation which is given a score of 7.5. What I don't understand is why I get the correct answers for the other tests in my IDE but they won't pass on HackerRank. If there is a max time then, why doesn't HackerRank identify that as a requirement?
int minOr = (k - 1) | k;
Replace your code with this line:
System.out.println((((k - 1) | k) > n && k % 2 == 0) ? k - 2 : k - 1);
Awsome!
Good explaination! , Thank you
thanks your piece of info was even more accurate
Great Explanation. Thank you so much.
Wow! This is mind-blowing. Thank you for the explanation.
thank you for the explanation helped a lot
Thank you for such fantastic explanation.