Given a non-negative number n and two values l and r. The problem is to check whether all the bits are unset or not in the range l to r in the binary representation of n. The bits are numbered from right to left, i.e., the least significant bit is considered to be at first position.
Constraint: 1 <= l <= r <= number of bits in the binary representation of n.
Input : n = 17, l = 2, r = 4 Output : Yes (17)10 = (10001)2 The bits in the range 2 to 4 are all unset. Input : n = 39, l = 4, r = 6 Output : No (39)10 = (100111)2 The bits in the range 4 to 6 are all not unset.
Approach: Following are the steps:
- Calculate num = ((1 << r) – 1) ^ ((1 << (l-1)) – 1). This will produce a number num having r number of bits and bits in the range l to r are the only set bits.
- Calculate new_num = n & num.
- If new_num == 0, return “Yes” (all bits are unset in the given range).
- Else return “No” (all bits are not unset in the given range).
- Check whether all the bits are unset in the given range or not
- Unset bits in the given range
- Count unset bits in a range
- Python | Count unset bits in a range
- Check if a number has same number of set and unset bits
- Check whether all the bits are set in the given range
- Check whether bits are in alternate pattern in the given range | Set-2
- Check if bits in range L to R of two numbers are complement of each other or not
- Check whether bits are in alternate pattern in the given range
- Unset the last m bits
- Count unset bits of a number
- Find the smallest number with n set and m unset bits
- Find the largest number with n set and m unset bits
- Count total unset bits in all the numbers from 1 to N
- Check whether the bit at given position is set or unset
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to email@example.com. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.
Improved By : Smitha Dinesh Semwal