## Check if all the 1’s in a binary string are equidistant or not

Given a binary string str, the task is to check if all the 1’s in the string are equidistant or not. The term equidistant means… Read More »

- Maximum contiguous 1 possible in a binary string after k rotations
- Number of Binary Strings of length N with K adjacent Set 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
- Generate all the binary strings of N bits
- Recursive Program for Binary to Decimal
- Divide binary array into three equal parts with same value
- Minimum swaps required to convert one binary string to another
- Minimum number of 1's to be replaced in a binary array
- Occurrences of a pattern in binary representation of a number
- Minimum number of operations required to sum to binary string S
- 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 swaps required to make a binary string alternating
- Check if all the 1's in a binary string are equidistant or not
- 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"
- Count of values of x <= n for which (n XOR x) = (n - x)
- Bitwise AND of N binary strings
- Count of cyclic permutations having XOR with other binary string as 0
- Check if a binary string contains consecutive same or not
- Ways to divide a binary array into sub-arrays such that each sub-array contains exactly one 1
- Lucky alive person in a circle | Set - 2
- Minimum steps to remove substring 010 from a binary string
- Check If every group of a's is followed by a group of b's of same length
- Maximum consecutive one’s (or zeros) in a binary circular array
- Construct a binary string following the given constraints
- Check if it is possible to rearrange a binary string with alternate 0s and 1s
- Maximum Consecutive Zeroes in Concatenated Binary String
- Minimum number of moves to make a binary array K periodic

Given a binary string str, the task is to check if all the 1’s in the string are equidistant or not. The term equidistant means… Read More »

Given an integer N. The task is to find the number of all possible distinct binary strings of length N which have at least 3… Read More »

Given an integer N, the task is to generate all possible binary strings of length N which contain “01” as the sub-string exactly twice. Examples:… Read More »

Given a binary circular array of size N, the task is to find the count maximum number of consecutive 1’s present in the circular array.… Read More »

Given two integers N and K, the task is to count the number of ways to make a binary string of length N such that… Read More »

Given a positive integer number N. The task is to generate all the binary strings of N bits. These binary strings should be in ascending… Read More »

Given a binary string str. In a single operation, we can change any ‘1’ to ‘0’ or any ‘0’ to ‘1’. The task is to… Read More »

Given a binary string str, the task is to find the count of deletion of the sub-string “01” or “10” from the string so that… Read More »

Given an array arr[] of binary strings, the task is to calculate the bitwise AND of all of these strings and print the resultant string.… Read More »

Given a binary array arr[] (containing only 0s and 1s) and an integer K. The task is to find the minimum number of moves to… Read More »

Given two binary strings A and B of length N and M (up to 105). The task is to repeat the below process and find… Read More »

Given two strings S and T of equal length. Both strings contain only the characters ‘0’ and ‘1’. The task is to find the minimum… Read More »

Given an array a[] consisting only 0 and 1. The task is to check if it is possible to transform the array such that the… Read More »

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 »