## Minimum cost to traverse from one index to another in the String

Given a string S of length N consisting of lower case character, the task is to find the minimum cost to reach from index i… Read More »

- Minimum number of times A has to be repeated such that B is a substring of it
- Java program to check whether a string is a Palindrome
- Largest substring with same Characters
- InfyTQ 2019 : Find the position from where the parenthesis is not balanced
- C++ program to compare two Strings using Operator Overloading
- Swap characters in a String
- Rearrange the characters of the string such that no two adjacent characters are consecutive English alphabets
- Sort an array of strings according to string lengths using Map
- Convert an unbalanced bracket sequence to a balanced sequence
- Check whether two strings are anagrams of each other using unordered_map in C++
- Maximum number of given operations to remove the entire string
- Print characters and their frequencies in order of occurrence using a LinkedHashMap in Java
- Maximum String Partition
- Number of substrings that start with "geeks" and end with "for"
- Lexicographically smallest string formed by appending a character from first K characters of a string | Set 2
- Round the given number to nearest multiple of 10 | Set-2
- String Range Queries to find the number of subsets equal to a given String
- Count number of substrings of a string consisting of same characters
- Count of words ending at the given suffix in Java
- Check if the given string is vowel prime
- Program to duplicate Vowels in String
- Count all substrings having character K
- Lexicographically smallest string of length N and sum K
- Compare two strings considering only alphanumeric characters
- 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
- Encrypt the given string with the following operations
- Check duplicates in a stream of strings
- Frequency of a substring in a string using pthread
- Queries for rotation and Kth character of the given string in constant time

Given a string S of length N consisting of lower case character, the task is to find the minimum cost to reach from index i… 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 a character X and a string Y of length N and the task is to find the number of ways to convert X to… Read More »

Given a string str of length L and an integer N, the task is to form a total of (L / N) contiguous subsegments of… Read More »

Given a binary tree in such a way such that the level order traversal of a binary tree produces a string S. The task is… Read More »

Given a string str, the task is to print the frequency of each of the characters of str in alphabetical order. Example: Input: str =… Read More »

Given the number of rows R and the number of columns C, the task is to print a doormat pattern as shown in the examples… 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 a binary string S of length N and an integer K, the task is to find the smallest non-zero sub-string of S that can… Read More »

Given a string str and an integer K, the task is to print the length of the longest possible substring that has exactly K unique… 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 two strings X and Y containing lower-case alphabets, the task is to check whether any permutation of string X exists in Y as its… Read More »