## Minimum swaps required to convert one binary string to another

Given two binary string M and N of equal length, the task is to find a minimum number of operations (swaps) required to convert string… Read More »

- Number of Binary Strings of length N with K adjacent Set Bits
- Check if a binary string has two consecutive occurrences of one everywhere
- 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 moves in a stack or queue are possible or not
- Count of values of x <= n for which (n XOR x) = (n - x)
- 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
- 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
- Find Bit whose minimum sequence flips makes all bits same
- Find the n-th binary string in sorted order
- Minimum steps to convert one binary string to other only using negation
- 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
- Final string after performing given operations

Given two binary string M and N of equal length, the task is to find a minimum number of operations (swaps) required to convert string… Read More »

Given that N person (numbered 1 to N) standing as to form a circle. They all have the gun in their hand which is pointed… Read More »

Given a binary string, you can rotate any substring of this string. For Example, let string be denoted by s. Let the first element of… Read More »

Given a binary string composed of 0’s and 1’s. The task is to find the number of unique permutation of the string which starts with… Read More »

Given a binary string str, the task is to print the numbers of steps required to convert it to one by the following operations: If… Read More »

Given a binary string, task is to convert this string in to two’s compliment with the help of XOR operator. Examples: Input : 00000101 Output… Read More »

Given a string str. The task is to check whether it is a binary string or not. Examples: Input: str = “01010101010” Output: Yes Input:… Read More »

Given a string consisting of 1 and 0, the task is to find out the maximum power of jump required to reach the end of… Read More »

Given a binary string representing the scores of a Volleyball match. The task is to find the winner of the match according to below conditions:… Read More »

Given an array of 0s and 1s, find the position of 0 to be replaced with 1 to get longest continuous sequence of 1s. Expected… Read More »

Given a binary string and a number m, the task is to check if the string has m consecutive 1’s or 0’s Examples: Input :… Read More »

Given a binary string and k, to check whether it’s contains all permutations of length k or not. Examples: Input : Binary string 11001 k… Read More »

Given n binary strings, return their sum (also a binary string). Examples: Input: arr[] = [“11”, “1”] Output: “100” Input : arr[] = [“1”, “10”,… Read More »

Given a Binary Circular Array of size N elements and two positive integers x and y indicating the indices in the circular array. The task… Read More »

Given an array arr containing elements from [1…to n]. Each element appears exactly once in the array arr. Given an string str of length n-1.… Read More »