## Minimum cost to partition the given binary string

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 »

- Optimally accommodate 0s and 1s from a Binary String into K buckets
- Count of non-overlapping sub-strings "101" and "010" in the given binary string
- 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
- Longest sub string of 0's in a binary string which is repeated K times
- 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
- Check whether str1 can be converted to str2 with the given operations
- Minimum number of Binary strings to represent a Number

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 »

Given a binary string str of length N, the task is to find the maximum count of substrings str can be divided into such that… Read More »

Given an integer N, the task is to find the Nth even palindromic number of even length and only comprising of the digits X and… Read More »

Given a binary string S, the task is to find the number of ways to split it into parts such that every part is divisible… Read More »

Given a binary string S, the task is to find the maximum number of parts that you can split it into such that every part… Read More »

Given a large binary string str and an integer K, the task is to find the value of str % K. Examples: Input: str =… Read More »

Given an integer N, the task is to count the number of binary strings possible of length N such that they don’t contain “111” as… Read More »

Given a binary number as a string str of length L. The task is to find the minimum number of operations needed so that the… Read More »

Given a binary string str, the task is to find the minimum number of operations required to make all the characters of the string same… Read More »

Given a number N. The task is to find the minimum number of binary strings required to represent the given number as the sum of… Read More »

Given binary string S of size N and a number K. The task is to find the Longest sub string of 0’s in the string… Read More »

Given a binary string str, the task is to find the count of non-overlapping sub-strings of either the form “010” or “101”. Examples: Input: str… Read More »

Given a binary string S, consisting of 0’s and 1’s. You have to accommodate the 0’s and 1’s into the K buckets in such a… Read More »

Given two binary strings str1 and str2. The task is to check whether it is possible to convert str1 to str2 by applying the below… Read More »