## Minimum bit changes in Binary Circular array to reach a index

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 »

- Maximum power of jump required to reach the end of string
- 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 number of 1's to be replaced in a binary array
- Occurrences of a pattern in binary representation of a number
- Length of longest consecutive ones by at most one swap in a Binary String
- Number of steps required to convert a binary number to one
- Minimum swaps required to convert one binary string to another
- Count of cyclic permutations having XOR with other binary string as 0
- Minimum swaps required to make a binary string alternating
- Python | Check if a given string is binary string or not
- Minimum number of operations required to sum to binary string S
- Check if moves in a stack or queue are possible or not
- Number of unique permutations starting with 1 of a Binary String
- Construct a binary string following the given constraints
- Check If every group of a's is followed by a group of b's of same length
- Recursive Program for Binary to Decimal
- Minimum steps to remove substring 010 from a binary string
- Check if it is possible to rearrange a binary string with alternate 0s and 1s
- Find the winner of a game where scores are given as a binary string
- Lucky alive person in a circle | Set - 2
- 2's compliment for a givin string using XOR
- Find Bit whose minimum sequence flips makes all bits same
- Minimum steps to convert one binary string to other only using negation
- Find the n-th binary string in sorted order
- Remove one bit from a binary number to get maximum value
- Final string after performing given operations
- Arrange a binary string to get maximum value within a range of indices
- Count of values of x <= n for which (n XOR x) = (n - x)

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. Examples : Input : [0, 0, 1, 0, 1, 0, 1, 1] Output :… 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 »

Given an array A of size N consisting of elements 1 to N. A boolean array B consisting of N-1 elements indicates that if B[i]… Read More »

Given a decimal number m, convert it into a binary string and apply n iterations, in each iteration 0 becomes “01” and 1 becomes “10”.… Read More »

Given a binary string of 0s and 1s. The task is to find the length of substring which is having a maximum difference of number… Read More »

Given a binary string of size N. Count all substring that have even decimal value considering binary to decimal conversion from left to right (For… Read More »

Given K and a binary number, check if there exists k consecutive 1’s in the binary number. Examples: Input : binary number = 101010101111 k… Read More »