Skip to content
Related Articles

Related Articles

Table of Contents

Improve Article
Save Article
Like Article

Check if all the set bits of the binary representation of N are at least K places away

  • Last Updated : 04 Jun, 2021

Given numbers N and K, The task to check if all the set bits of the binary representation of N are at least K places away.

Examples:  

Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready.  To complete your preparation from learning a language to DS Algo and many more,  please refer Complete Interview Preparation Course.

In case you wish to attend live classes with experts, please refer DSA Live Classes for Working Professionals and Competitive Programming Live for Students.

Input: N = 5, K = 1 
Output: YES
Explanation: 
Binary of 5 is 101.
The 1's are 1 place far from each other.

Input: N = 10, K = 2
Output: NO
Explanation:
Binary of 10 is 1010.
The 1's are not at least 2 places far from each other.

Approach: 

  1. Iterate Over all the bits in the binary representation of N and maintain a variable ‘count’ initialize to 0.
  2. Whenever you find a set bit(1), check if count <= K. If not return false.
  3. If you find a unset bit(0), increases the value of count by 1. 
     

Below is the implementation of the above approach.

C++




// C++ program to check if all the set
// bits of the binary representation
// of N are at least K places away.
#include <bits/stdc++.h>
using namespace std;
 
bool CheckBits(int N, int K)
{
    // Initialize check and count
    // with 0
    int check = 0;
    int count = 0;
 
    for (int i = 31; i >= 0; i--)
    {
 
        // The i-th bit is a set bit
        if ((1 << i) & N)
        {
 
            // This is the first set bit so,
            // start calculating all the
            // distances between consecutive
            // bits from here
            if (check == 0)
            {
                check = 1;
            }
            else
            {
                // If count is less than K
                // return false
                if (count < K)
                {
                    return false;
                }
            }
            count = 0;
        }
        else
        {
            // Adding the count as the
            // number of zeroes increase
            // between set bits
            count++;
        }
    }
 
    return true;
}
// Driver code
int main()
{
 
    int N = 5;
    int K = 1;
 
    if(CheckBits(N, K))
    {
        cout << "YES";
    }
    else
    {
        cout << "NO";
    }
 
 
 
    return 0;
}
Java



// Java program to check if all the set
// bits of the binary representation
// of N are at least K places away.
import java.util.*;
 
class GFG{
 
static boolean CheckBits(int N, int K)
{
     
    // Initialize check and count
    // with 0
    int check = 0;
    int count = 0;
 
    for(int i = 31; i >= 0; i--)
    {
         
        // The i-th bit is a set bit
        if (((1 << i) & N) > 0)
        {
             
            // This is the first set bit so,
            // start calculating all the
            // distances between consecutive
            // bits from here
            if (check == 0)
            {
                check = 1;
            }
            else
            {
                 
                // If count is less than K
                // return false
                if (count < K)
                {
                    return false;
                }
            }
            count = 0;
        }
        else
        {
             
            // Adding the count as the
            // number of zeroes increase
            // between set bits
            count++;
        }
    }
    return true;
}
 
// Driver code
public static void main(String[] args)
{
    int N = 5;
    int K = 1;
 
    if (CheckBits(N, K))
    {
        System.out.print("YES");
    }
    else
    {
        System.out.print("NO");
    }
}
}
 
// This code is contributed by shikhasingrajput
Python3



# Python3 program to check if all the set
# bits of the binary representation
# of N are at least K places away.
def CheckBits(N, K):
     
    # Initialize check and count
    # with 0
    check = 0
    count = 0
 
    for i in range(31, -1, -1):
 
        # The i-th bit is a set bit
        if ((1 << i) & N):
 
            # This is the first set bit so,
            # start calculating all the
            # distances between consecutive
            # bits from here
            if (check == 0):
                check = 1
 
            else:
 
                # If count is less than K
                # return false
                if (count < K):
                    return False
 
            count = 0
 
        else:
 
            # Adding the count as the
            # number of zeroes increase
            # between set bits
            count += 1
 
    return True
 
# Driver code
if __name__ == "__main__":
     
    N = 5
    K = 1
 
    if (CheckBits(N, K)):
        print("YES")
    else:
        print("NO")
 
# This code is contributed by chitranayal
C#



// C# program to check if all the set
// bits of the binary representation
// of N are at least K places away.
using System;
public class GFG{
 
  static bool CheckBits(int N, int K)
  {
 
    // Initialize check and count
    // with 0
    int check = 0;
    int count = 0;
 
    for(int i = 31; i >= 0; i--)
    {
 
      // The i-th bit is a set bit
      if (((1 << i) & N) > 0)
      {
 
        // This is the first set bit so,
        // start calculating all the
        // distances between consecutive
        // bits from here
        if (check == 0)
        {
          check = 1;
        }
        else
        {
 
          // If count is less than K
          // return false
          if (count < K)
          {
            return false;
          }
        }
        count = 0;
      }
      else
      {
 
        // Adding the count as the
        // number of zeroes increase
        // between set bits
        count++;
      }
    }
    return true;
  }
 
  // Driver code
 
  static public void Main ()
  {
 
    int N = 5;
    int K = 1;
 
    if (CheckBits(N, K))
    {
      Console.Write("YES");
    }
    else
    {
      Console.Write("NO");
    }
 
 
  }
}
 
// This code is contributed by avanitrachhadiya2155
Javascript



<script>
 
// Javascript program to check if all the set
// bits of the binary representation
// of N are at least K places away.
function CheckBits(N, K)
{
     
    // Initialize check and count
    // with 0
    var check = 0;
    var count = 0;
 
    for(var i = 31; i >= 0; i--)
    {
         
        // The i-th bit is a set bit
        if (((1 << i) & N) > 0)
        {
             
            // This is the first set bit so,
            // start calculating all the
            // distances between consecutive
            // bits from here
            if (check == 0)
            {
                check = 1;
            }
            else
            {
                 
                // If count is less than K
                // return false
                if (count < K)
                {
                    return false;
                }
            }
            count = 0;
        }
        else
        {
             
            // Adding the count as the
            // number of zeroes increase
            // between set bits
            count++;
        }
    }
    return true;
}
 
// Driver Code
var N = 5;
var K = 1;
 
if (CheckBits(N, K))
{
    document.write("YES");
}
else
{
    document.write("NO");
}
 
// This code is contributed by Ankita saini
 
</script>
Output: 
YES
 



My Personal Notes
arrow_drop_up
Previous
Design a Queue data structure to get minimum or maximum in O(1) time
Next

Splitting Arrays in NumPy
Recommended Articles
Page :
Prime Number of Set Bits in Binary Representation | Set 1
15, May 18
Number of mismatching bits in the binary representation of two integers
29, Oct 18
Count of total bits toggled/flipped in binary representation of 0 to N
24, Jun 20
Check if all bits can be made same by flipping two consecutive bits
09, Jan 20
Minimize cost of swapping set bits with unset bits in a given Binary string
18, Aug 21
Check if bits of a number has count of consecutive set bits in increasing order
12, Jan 17
Count of pairs {X, Y} from an array such that sum of count of set bits in X ⊕ Y and twice the count of set bits in X & Y is M
12, Mar 21
Print numbers having first and last bits as the only set bits
15, Jan 18
Flip bits of the sum of count of set bits of two given numbers
03, Jan 21
Minimum bit flips such that every K consecutive bits contain at least one set bit
11, Jun 20
Check if binary representation of a number is palindrome
13, Jun 14
Check if actual binary representation of a number is palindrome
11, Jan 18
Check if the binary representation of a number has equal number of 0s and 1s in blocks
16, Jan 19
Check if decimal representation of Binary String is divisible by 9 or not
31, Oct 20
Check if given number contains only “01” and “10” as substring in its binary representation
27, Jan 21
Check if Decimal representation of given Binary String is divisible by K or not
13, Jul 21
Check if binary representation of a given number and its complement are anagram
31, Jul 17
Toggle bits of a number except first and last bits
14, Jan 18
Maximum number of consecutive 1's in binary representation of all the array elements
15, Nov 19
Unset least significant K bits of a given number
08, Sep 20
Check whether all the bits are set in the given range
07, Sep 17
Check if all bits of a number are set
27, Jun 17
Check whether the number has only first and last bits set | Set 2
19, Jun 18
Count total set bits in all numbers from 1 to n | Set 2
10, Jul 19
Article Contributed By :
https://media.geeksforgeeks.org/auth/avatar.png
veedee
@veedee
Vote for difficulty





Improved By :
Article Tags :
Practice Tags :
Report Issue

We use cookies to ensure you have the best browsing experience on our website. By using our site, you
acknowledge that you have read and understood our
Cookie Policy &
        Privacy Policy

Lightbox

Start Your Coding Journey Now!