Skip to content
Related Articles

Related Articles

Table of Contents

Improve Article
Save Article
Like Article

Check divisibility of binary string by 2^k

  • Difficulty Level : Easy
  • Last Updated : 04 May, 2021

Given a binary string and a number k, task is to check whether the binary string is evenly divisible by 2k or not. 

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 : 11000  k = 2
Output : Yes
Explanation :
(11000)2 = (24)10
24 is evenly divisible by 2k i.e. 4.
 
Input : 10101  k = 3
Output : No
Explanation : 
(10101)2 = (21)10
21 is not evenly divisible by 2k i.e. 8.

Naive Approach : Compute the binary string into decimal and then simply check whether it is divisible by 2k. But, this approach is not feasible for long binary string as time complexity will be high for computing decimal number from binary string and then dividing it by 2k.



Efficient Approach : In the binary string, check for last k bits. If the all the last k bits are 0, then the binary number is evenly divisible by 2k else it is not evenly divisible. Time complexity using this approach is O(k). 

Below is the implementation of the approach. 

C++




// C++ implementation to check whether
// given binary number is evenly
// divisible by 2^k or not
#include <bits/stdc++.h>
using namespace std;
 
// function to check whether
// given binary number is
// evenly divisible by 2^k or not
bool isDivisible(char str[], int k)
{
    int n = strlen(str);
    int c = 0;
     
    // count of number of 0 from last
    for (int i = 0; i < k; i++)   
        if (str[n - i - 1] == '0')        
            c++;
     
    // if count = k, number is evenly
    // divisible, so returns true else
    // false
    return (c == k);
}
 
// Driver program to test above
int main()
{
    // first example
    char str1[] = "10101100";
    int k = 2;
    if (isDivisible(str1, k))
        cout << "Yes" << endl;
    else
        cout << "No"
             << "\n";
 
    // Second example
    char str2[] = "111010100";
    k = 2;
    if (isDivisible(str2, k))
        cout << "Yes" << endl;
    else
        cout << "No" << endl;
 
    return 0;
}
Java



// Java implementation to check whether
// given binary number is evenly
// divisible by 2^k or not
class GFG {
     
    // function to check whether
    // given binary number is
    // evenly divisible by 2^k or not
    static boolean isDivisible(String str, int k)
    {
        int n = str.length();
        int c = 0;
     
        // count of number of 0 from last
        for (int i = 0; i < k; i++)
            if (str.charAt(n - i - 1) == '0')        
                c++;
     
        // if count = k, number is evenly
        // divisible, so returns true else
        // false
        return (c == k);
    }
 
    // Driver program to test above
    public static void main(String args[])
    {
         
        // first example
        String str1 = "10101100";
        int k = 2;
        if (isDivisible(str1, k) == true)
            System.out.println("Yes");
        else
            System.out.println("No");
 
    // Second example
        String str2 = "111010100";
        k = 2;
        if (isDivisible(str2, k) == true)
            System.out.println("Yes");
        else
            System.out.println("No");
    }
}
 
// This code is contributed by JaideepPyne.
Python3



# Python 3 implementation to check
# whether given binary number is
# evenly divisible by 2^k or not
 
# function to check whether
# given binary number is
# evenly divisible by 2^k or not
def isDivisible(str, k):
    n = len(str)
    c = 0
     
    # count of number of 0 from last
    for i in range(0, k):
        if (str[n - i - 1] == '0'):    
            c += 1
     
    # if count = k, number is evenly
    # divisible, so returns true else
    # false
    return (c == k)
 
# Driver program to test above
# first example
str1 = "10101100"
k = 2
if (isDivisible(str1, k)):
    print("Yes")
else:
    print("No")
 
# Second example
str2 = "111010100"
k = 2
if (isDivisible(str2, k)):
    print("Yes")
else:
    print("No")
 
# This code is contributed by Smitha
C#



// C# implementation to check whether
// given binary number is evenly
// divisible by 2^k or not
using System;
 
class GFG {
     
    // function to check whether
    // given binary number is
    // evenly divisible by 2^k or not
    static bool isDivisible(String str, int k)
    {
        int n = str.Length;
        int c = 0;
     
        // count of number of 0 from last
        for (int i = 0; i < k; i++)
            if (str[n - i - 1] == '0')    
                c++;
     
        // if count = k, number is evenly
        // divisible, so returns true else
        // false
        return (c == k);
    }
 
    // Driver program to test above
    public static void Main()
    {
         
        // first example
        String str1 = "10101100";
        int k = 2;
         
        if (isDivisible(str1, k) == true)
            Console.Write("Yes\n");
        else
            Console.Write("No");
 
        // Second example
        String str2 = "111010100";
        k = 2;
         
        if (isDivisible(str2, k) == true)
            Console.Write("Yes");
        else
            Console.Write("No");
    }
}
 
// This code is contributed by Smitha.
PHP



<?php
// PHP implementation to check whether
// given binary number is evenly
 
// function to check whether
// given binary number is
// evenly divisible by 2^k or not
function isDivisible($str, $k)
{
    $n = strlen($str);
    $c = 0;
     
    // count of number
    // of 0 from last
    for ($i = 0; $i < $k; $i++)
        if ($str[$n - $i - 1] == '0')    
            $c++;
     
    // if count = k,
    // number is evenly
    // divisible, so
    // returns true else
    // false
    return ($c == $k);
}
 
    // Driver Code
    // first example
    $str1 = "10101100";
    $k = 2;
    if (isDivisible($str1, $k))
        echo "Yes", "\n";
    else
        echo "No", "\n";
 
    // Second example
    $str2= "111010100";
    $k = 2;
    if (isDivisible($str2, $k))
        echo "Yes", "\n";
    else
        echo "No", "\n";
 
// This code is contributed by Ajit
?>
Javascript



<script>
 
// Javascript implementation to check whether
// given binary number is evenly
// divisible by 2^k or not
 
// Function to check whether
// given binary number is
// evenly divisible by 2^k or not
function isDivisible(str, k)
{
    let n = str.length;
    let c = 0;
   
    // Count of number of 0 from last
    for(let i = 0; i < k; i++)
        if (str[n - i - 1] == '0')    
            c++;
   
    // If count = k, number is evenly
    // divisible, so returns true else
    // false
    return (c == k);
}
 
// Driver code
 
// First example
let str1 = "10101100";
let k = 2;
 
if (isDivisible(str1, k) == true)
    document.write("Yes" + "</br>");
else
    document.write("No");
 
// Second example
let str2 = "111010100";
k = 2;
 
if (isDivisible(str2, k) == true)
    document.write("Yes");
else
    document.write("No");
     
// This code is contributed by rameshtravel07
 
</script>
Output: 
Yes
Yes
 
Time Complexity: O(k)
 



My Personal Notes
arrow_drop_up
Previous
Number of siblings of a given Node in n-ary Tree
Next

Array with GCD of any of its subset belongs to the given array
Recommended Articles
Page :
Check divisibility in a binary stream
16, Feb 17
To check divisibility of any large number by 999
26, Jun 17
Check the divisibility of Hexadecimal numbers
01, Nov 19
Divisibility by 64 with removal of bits allowed
05, Nov 17
Check if binary representations of 0 to N are present as substrings in given binary string
23, Jul 20
Periodic Binary String With Minimum Period and a Given Binary String as Subsequence.
27, Apr 20
Python | Check if a given string is binary string or not
30, Aug 18
Check if a string can be made palindromic by swapping pairs of characters from indices having unequal characters in a Binary String
31, Mar 21
Check whether a given binary tree is skewed binary tree or not?
18, Nov 18
Minimum number whose binary form is not a subsequence of given binary string
16, Jun 21
Check if a binary string has a 0 between 1s or not | Set 1 (General approach)
26, Jun 17
Check if a binary string has a 0 between 1s or not | Set 2 (Regular Expression Approach)
03, Jul 17
Check if an encoding represents a unique binary string
28, Oct 17
Check if binary string multiple of 3 using DFA
30, Jan 18
Check if a binary string contains all permutations of length k
08, Jun 18
Check whether a binary string can be formed by concatenating given N numbers sequentially
02, Nov 18
Check if it is possible to rearrange a binary string with alternate 0s and 1s
08, Nov 18
Check if a binary string has two consecutive occurrences of one everywhere
22, Jan 19
Check if a binary string contains consecutive same or not
25, Jan 19
Check if all the 1's in a binary string are equidistant or not
09, Apr 19
Check whether the binary equivalent of a number ends with given string or not
30, Jun 20
Check if all substrings of length K of a Binary String has equal count of 0s and 1s
08, Sep 20
Check if decimal representation of Binary String is divisible by 9 or not
31, Oct 20
Check if K '0's can be flipped such that Binary String contains no pair of adjacent '1's
14, Feb 21
Article Contributed By :
https://media.geeksforgeeks.org/auth/avatar.png
Ankit87
@Ankit87
Vote for difficulty
Current difficulty :
Easy





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!