## Find the winner of a game where scores are given as a binary string

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 »

- 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
- Minimum swaps required to make a binary string alternating
- Length of longest consecutive ones by at most one swap in a Binary String
- Minimum number of given operations required to convert a string to another string
- Number of steps required to convert a binary number to one
- 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)
- 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
- Check If every group of a's is followed by a group of b's of same length
- Lucky alive person in a circle | Set - 2
- 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 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 »

We are given an integer N. We need to count the total number of such binary strings of length N such that the number of… Read More »

There are n student groups at the school. On each day in school, there are m time slots. A student group may or may not… Read More »

Given a binary string and a number k, task is to check whether the binary string is evenly divisible by 2k or not. Examples :… Read More »

Dragon Curve Sequence is an infinite binary sequence of 0s and 1s. The first term of the sequence is 1. From the next term, we… Read More »

Thue–Morse sequence, or Prouhet–Thue–Morse sequence, is an infinite binary sequence of 0s and 1s. The sequence is obtained by starting with 0 and successively appending… Read More »

Given n and k, Construct a palindrome of size n using a binary number of size k repeating itself to wrap into the palindrome. The… Read More »

Given a binary array, task is to sort this binary array using minimum swaps. We are allowed to swap only adjacent elements Examples: Input :… Read More »

Given a string of character the task is to convert each character of a string into the equivalent binary number. Examples : Input : GFG… Read More »