## Number of binary strings such that there is no substring of length ≥ 3

Given an integer N, the task is to count the number of binary strings possible such that there is no substring of length ≥ 3… 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 an integer N, the task is to count the number of binary strings possible such that there is no substring of length ≥ 3… Read More »

Given two binary strings of equal length, the task is to find the minimum number of swaps to make them equal. Swapping between two characters… Read More »

Given a binary string, the task is to find whether all the digits of the string can be made equal i.e either 0 or 1… Read More »

Given N binary strings b1, b2, b3…. bn. The task is to find the maximum number of binary strings that you can make palindromic by… Read More »

Given two special characters, the first character can be represented by one bit which is 0 and the second character can be represented by two… Read More »

Given a binary string S of length N, the task is to find the length of the longest sub-sequence in it which is divisible by… Read More »

Given a binary string S of length N, the task is to find the number of sub-sequences of non-zero length which are divisible by 3.… Read More »

Given a binary string S of length N and an integer K, the task is to find the minimum number of adjacent swaps required to… Read More »

Given two integers M and N the task is to find the number formed by concatenating the binary equivalents of M and N i.e. M… Read More »

Given a binary string str of length N, the task is to find the count of substrings of str which are divisible by 2. Leading… Read More »

Given two binary string of unequal lengths A and B, the task is to print the binary string which is the XOR of A and… Read More »

Given a binary string str of length N, the task is to find the longest sub-string divisible by 2. If no such sub-string exists then… Read More »

Given a binary string str of length N, the task is to find the count of subsequences of str which are divisible by 2. Leading… Read More »

Given a binary string str and an integer K, the task is to find the minimum cost required to partition the string into exactly K… Read More »

The task is to generate a binary string of length N using branch and bound technique Examples: Input: N = 3 Output: 000 001 010… Read More »