## Find Bit whose minimum sequence flips makes all bits same

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 »

- Minimum given operations required to convert a given binary string to all 1's
- Minimum operations required to convert a binary string to all 0s or all 1s
- Modulo of a large Binary String
- Count number of binary strings such that there is no substring of length greater than or equal to 3 with all 1's
- Minimum number of Binary strings to represent a Number

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 »

Given a string str containing only characters x and y, the task is to perform the following operations while possible: Find an index such that… Read More »

Given a binary number, the task is to remove exactly one bit from it such that, after it’s removal, the resultant binary number is greatest… Read More »

Given two binary strings A and B, the task is to convert A to B by choosing any sub-string of A and negating it (replace… Read More »

Given two binary strings and . Let be set of all the cyclic permutations of string . The task is to find how many strings… Read More »

Given a binary array arr[] of zero’s and one’s only. The task is to find the minimum number of one’s to be changed to zero… Read More »

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 »