## Maximum contiguous 1 possible in a binary string after k rotations

Given a binary string, you can rotate any substring of this string. For Example, let string be denoted by s. Let the first element of… Read More »

Given a binary string, you can rotate any substring of this string. For Example, let string be denoted by s. Let the first element of… Read More »

Given a string, the task is to find the number of characters with the same adjacent characters. Note: First and last character will always be… Read More »

Given a string S consisting of lowercase characters(a-z) only, the task is to print a new string by rearranging the string in such a way… Read More »

Given a Number N, the task is to find the Remainder when N is divided by R (a two digit Number). The input of the… Read More »

Given a string consisting of only lowercase English alphabets. The task is to find and replace the minimal number of characters by any lower case… Read More »

Given two strings S1 and S2 ( size of S1 <= Size of S2 ). The task is to find the minimum number of characters… Read More »

Given a bracket sequence of even length. The task is to find how many ways are there to make balanced bracket subsequences from the given… Read More »

Given a string of containing only L’s and R’s which represents left rotation and right rotation respectively. The task is to find the final direction… Read More »

Given two numbers, the task is to find the number of carry operations required when two numbers are added as below. 1234 + 5678 ——–… Read More »

Given an equation of the form: a + b = c Out of which any one of the terms , or is missing. The task… Read More »

Given a string str. The task is to find the product of ASCII values of characters in the string. Examples: Input : str = “IS”… Read More »

Given a string str of lowercase alphabets only. The task is to replace every character by some new character. The new character belongs to (small… Read More »

Given a string str containing only lower and uppercase alphabets. The task is to check if both lowercase characters and uppercase characters follow the same… Read More »

Given two string S and Q. The task is to count the number of the common subsequence in S and T. Examples: Input : S… Read More »

Given a string str containing only lowercase alphabets, the task is to minimize the length of the string after performing the following operation: Delete all… Read More »