## Minimum steps to remove substring 010 from a binary string

Given a binary string, the task is to count the minimum steps to remove substring “010” from this binary string. Examples: Input: binary_string = “0101010”… 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
- Check if a binary string has two consecutive occurrences of one everywhere
- Minimum number of 1's to be replaced in a binary array
- Minimum swaps required to convert one binary string to another
- Recursive Program for Binary to Decimal
- Minimum number of operations required to sum to binary string S
- Occurrences of a pattern in binary representation of a number
- Length of longest consecutive ones by at most one swap in a Binary String
- Minimum swaps required to make a binary string alternating
- Minimum number of given operations required to convert a string to another string
- Number of steps required to convert a binary number to one
- Count of values of x <= n for which (n XOR x) = (n - x)
- 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 cyclic permutations having XOR with other binary string as 0
- Generate all the binary strings of N bits
- Check if a binary string contains consecutive same or not
- Bitwise AND of N binary strings
- Ways to divide a binary array into sub-arrays such that each sub-array contains exactly one 1
- Number of unique permutations starting with 1 of a Binary String
- Minimum steps to remove substring 010 from a binary string
- Lucky alive person in a circle | Set - 2
- Check If every group of a's is followed by a group of b's of same length
- Check if it is possible to rearrange a binary string with alternate 0s and 1s
- 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
- Find Bit whose minimum sequence flips makes all bits same

Given a binary string, the task is to count the minimum steps to remove substring “010” from this binary string. Examples: Input: binary_string = “0101010”… Read More »

Given a binary string of length at-least two. We need to check if it is possible to rearrange a binary string such that there alternate… Read More »

Given an array A of length n such that it contains only ‘0s’ and ‘1s’. The task is to divide the array into THREE different… Read More »

You are given a binary string str of length n. Suppose you create another string of size n * k by concatenating k copies of… Read More »

Given a sequence of ‘n’ numbers (without leading zeros), the task is to find whether it is possible to create a binary string by concatenating… Read More »

You are given a binary string of even length and equal number of 0’s and 1’s. What is the minimum number of swaps to make… Read More »

Given a string consisting of only 0’s and 1’s. Now you are given N non-intersecting ranges L, R ( L <= R), more specifically [L1,… Read More »

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 »