## Ways to divide a binary array into sub-arrays such that each sub-array contains exactly one 1

Give an integer array arr[] consisting of elements from the set {0, 1}. The task is to print the number of ways the array can… Read More »

- Generate all the binary strings of N bits
- Find the number of binary strings of length N with at least 3 consecutive 1s
- Check if a binary string has two consecutive occurrences of one everywhere
- Number of Binary Strings of length N with K adjacent Set Bits
- Recursive Program for Binary to Decimal
- Occurrences of a pattern in binary representation of a number
- Minimum number of given operations required to convert a string to another string
- Length of longest consecutive ones by at most one swap in a Binary String
- Minimum number of operations required to sum to binary string S
- Check if all the 1's in a binary string are equidistant or not
- Count of cyclic permutations having XOR with other binary string as 0
- Check if moves in a stack or queue are possible or not
- Deletions of "01" or "10" in binary string to make it free from "01" or "10"
- Bitwise AND of N binary strings
- Count of values of x <= n for which (n XOR x) = (n - x)
- Check if a binary string contains consecutive same or not
- Maximum consecutive one’s (or zeros) in a binary circular array
- Ways to divide a binary array into sub-arrays such that each sub-array contains exactly one 1
- Check If every group of a's is followed by a group of b's of same length
- Find Bit whose minimum sequence flips makes all bits same
- Construct a binary string following the given constraints
- Minimum number of moves to make a binary array K periodic
- Find the n-th binary string in sorted order
- Number of ways to make binary string of length N such that 0s always occur together in groups of size K
- Minimum steps to convert one binary string to other only using negation
- Generate all binary strings of length n with sub-string "01" appearing exactly twice
- Minimum number of operations on a binary string such that it gives 10^A as remainder when divided by 10^B
- Print n 0s and m 1s such that no two 0s and no three 1s are together
- Remove one bit from a binary number to get maximum value
- Modify a binary array to Bitwise AND of all elements as 1

Give an integer array arr[] consisting of elements from the set {0, 1}. The task is to print the number of ways the array can… Read More »

Given a binary string str consisting of characters ‘0’ and ‘1’. The task is to find whether the string is valid or not. A string… Read More »

Given a string str consisting of only characters ‘a’ and ‘b’, the task is to check whether the string is valid or not. In a… Read More »

Given an integer n, the task is to find the number of possible values of 0 ≤ x ≤ n which satisfy n XOR x… Read More »

Given two integers n and m where n is the number of 0s and m is the number of 1s. The task is to print… Read More »

Given a positive integer n, the task is to find the nth string in the following infinite list of all possible strings over two symbols… Read More »

Given a string pat and an integer N, the task is to find the number of occurrences of the pattern pat in binary representation of… Read More »

Given a binary number as string, find its decimal equivalent. Examples: Input : binary = “101” Output : 5 Input : binary = “1111” Output… Read More »

Given a binary string S. Find the minimum number of operations required to be performed on the number zero to convert it to the number… Read More »

Given a binary array, where 1 denotes push operation and 0 denotes a pop operation in a stack or queue. The task is to check… Read More »

Given and . The task is to find the number of binary strings of length n out of 2n such that they satisfy f(bit string)… Read More »

Given three integers A, B and X. The task is to construct a binary string str which has exactly A number of 0’s and B… Read More »

Given a string str, the task is to check whether every group of consecutive a’s is followed by a group of consecutive b’s of same… Read More »

Given a Binary String of length . It is allowed to do at most one swap between any 0 and 1. The task is to… Read More »

Given a binary string consisting only of 1’s and 0’s. Find the bit (output is either 1 or 0)whose the minimum number of contiguous sequence… Read More »