## Minimum number of moves to make a binary array K periodic

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 »

- Maximum contiguous 1 possible in a binary string after k rotations
- Number of Binary Strings of length N with K adjacent Set Bits
- Divide binary array into three equal parts with same value
- Minimum swaps required to convert one binary string to another
- Occurrences of a pattern in binary representation of a number
- Minimum number of 1's to be replaced in a binary array
- Python | Check if a given string is binary string or not
- Length of longest consecutive ones by at most one swap in a Binary String
- Minimum swaps required to make a binary string alternating
- Recursive Program for Binary to Decimal
- Check if a binary string has two consecutive occurrences of one everywhere
- Number of steps required to convert a binary number to one
- Count of values of x <= n for which (n XOR x) = (n - x)
- Minimum number of operations required to sum to binary string S
- Count of cyclic permutations having XOR with other binary string as 0
- Check if moves in a stack or queue are possible or not
- Minimum number of given operations required to convert a string to another string
- Check if a binary string contains consecutive same or not
- Number of unique permutations starting with 1 of a Binary String
- Minimum steps to remove substring 010 from a binary string
- 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
- Construct a binary string following the given constraints
- Check if it is possible to rearrange a binary string with alternate 0s and 1s
- Find Bit whose minimum sequence flips makes all bits same
- Lucky alive person in a circle | Set - 2
- Find the n-th binary string in sorted order
- Minimum steps to convert one binary string to other only using negation
- 2's compliment for a givin string using XOR
- Print n 0s and m 1s such that no two 0s and no three 1s are together

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 »

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 »