Given a number N and a bit number K, check if Kth bit of N is set or not. A bit is called set if it is 1. Position of set bit '1' should be indexed starting with 0 from LSB side in binary representation of the number.
Input: N = 4, K = 0 Output: No Explanation: Binary representation of 4 is 100, in which 0th bit from LSB is not set. So, return false.
Input: N = 4, K = 2 Output: Yes Explanation: Binary representation of 4 is 100, in which 2nd bit from LSB is set. So, return true.
Input: N = 500, K = 3 Output: No Explanation: Binary representation of 500 is 111110100, in which 3rd bit from LSB is not set. So, return false.
We strongly recommend solving this problem on your own before viewing its editorial. Do you still want to view the editorial?Yes