Stream of binary number is coming, the task is to tell the number formed so far is divisible by a given number n.
At any given time, you will get 0 or 1 and tell whether the number formed with these bits is divisible by n or not.
Generally, e-commerce companies ask this type of questions. It was asked me in Microsoft interview. Actually that question was a bit simple, interviewer fixed the n to 3.
Keep on calculating the number formed and just check divisibility by n.
Problem in this solution: What about the overflow. Since 0 and 1 will keep on coming and the number formed will go out of range of integer.
In this solution, we just maintain the remainder if remainder is 0, the formed number is divisible by n otherwise not. This is the same technique that is used in Automata to remember the state. Here also we are remembering the state of divisibility of input number.
In order to implement this technique, we need to observe how the value of a binary number changes, when it is appended by 0 or 1.
Let’s take an example. Suppose you have binary number 1.
If it is appended by 0 it will become 10 (2 in decimal) means 2 times of the previous value.
If it is appended by 1 it will become 11(3 in decimal), 2 times of previous value +1.
How does it help in getting the remainder?
Any number (n) can be written in the form m = an + r where a, n and r are integers and r is the remainder. So when m is multiplied by any number so the remainder. Suppose m is multiplied by x so m will be mx = xan + xr. so (mx)%n = (xan)%n + (xr)%n = 0 + (xr)%n = (xr)%n;
We need to just do the above calculation (calculation of value of number when it is appended by 0 or 1 ) only over remainder.
When a binary number is appended by 0 (means multiplied by 2), the new remainder can be calculated based on current remainder only. r = 2*r % n; And when a binary number is appended by 1. r = (2*r + 1) % n;
1 0 1 0 1 -1
Press any key other than 0 and 1 to terminate no no no no yes
This article is contributed by Puneet. If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to firstname.lastname@example.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above
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.
- Check divisibility of binary string by 2^k
- Check divisibility by 7
- To check divisibility of any large number by 999
- Check if a large number is divisibility by 15
- Check if binary representations of 0 to N are present as substrings in given binary string
- Repeated Unit Divisibility
- Sub-string Divisibility by 3 Queries
- Sub-string Divisibility by 11 Queries
- Divisibility by 12 for a large number
- Divisibility by 64 with removal of bits allowed
- Maximize profit when divisibility by two numbers have associated profits
- Maximum path sum for each position with jumps under divisibility condition
- Check if binary string multiple of 3 using DFA
- Check if binary representations of two numbers are anagram
- Check if all the set bits of the binary representation of N are at least K places away
- Check if binary representation of a number is palindrome
- Check whether the binary equivalent of a number ends with "001" or not
- Check in binary array the number represented by a subarray is odd or even
- Check if actual binary representation of a number is palindrome
- Check if binary representation of a given number and its complement are anagram