## Final state of the string after modification

Given a string S of length n representing n boxes adjacent to each other. A character R at index i represents that i-th box is… Read More »

- Methods to concatenate string in C/C++ with Examples
- Find the first maximum length even word from a string
- Repeated Character Whose First Appearance is Leftmost
- Count common characters in two strings
- Find the longest string that can be made up of other strings from the array
- Count substrings that contain all vowels | SET 2
- Convert character array to string in C++
- Check whether two strings contain same characters in same order
- Check for balanced parentheses in an expression | O(1) space | O(N^2) time complexity
- Program to find the kth character after decrypting a string
- Count of integers of length N and value less than K such that they contain digits only from the given set
- Minimum length substring with exactly K distinct characters
- Generate all permutations of a string that follow given constraints
- Maximize the happiness of the groups on the Trip
- Minimum number of times A has to be repeated such that B is a substring of it
- Rearrange characters in a string such that no two adjacent are same using hashing
- Check if two strings are same ignoring their cases
- Distinct palindromic sub-strings of the given string using Dynamic Programming
- Find the number of binary strings of length N with at least 3 consecutive 1s
- Print the longest prefix of the given string which is also the suffix of the same string
- Count pairs of non-overlapping palindromic sub-strings of the given string
- Minimum rotations required to get the same String | Set-2
- Append a digit in the end to make the number equal to the length of the remaining string
- Minimum steps to delete a string by deleting substring comprising of same characters
- Program to generate all possible valid IP addresses from given string | Set 2
- Find k-th character of decrypted string | Set - 2
- Minimum number of adjacent swaps to convert a string into its given anagram
- Check if a string can be obtained by rotating another string d places
- Optimally accommodate 0s and 1s from a Binary String into K buckets
- Count of substrings which contains a given character K times

Given a string S of length n representing n boxes adjacent to each other. A character R at index i represents that i-th box is… Read More »

You are given an array of strings str, the task is to find the score of a given string s from the array. The score… Read More »

Given a string, the task is to count the number of words whose sum of Ascii values is less than and greater than or equal… Read More »

Given two strings A and B, both strings contain characters a and b and are of equal lengths. There is one _ (empty space) in… Read More »

Given a string, find minimum no of swaps(not necessarily adjacent) to convert it into a string which have similar characters side by side. Examples: Input… Read More »

Given an integer N and a lowercase string. The string is repeated infinitely. The task is to find the No. of occurrences of a given… Read More »

Given a string including lowercase alphabets and numeric digits. The task is to construct another string which consist of sum of digits followed by sum… Read More »

Given a string str consisting of lowercase English alphabets, the task is to find the total number of palindromic sub-strings present in the sorted form… Read More »

Given a number in the form of a string. The task is to find the maximum sum and product of m consecutive digits that are… Read More »

Given a string str. The task is to count the minimum number of elements to be removed so that pairwise consecutive elements are same Examples:… Read More »

Given a string of length N of lowercase characters containing 0 or more vowels, the task is to find the count of vowels occurred in… Read More »

Given two strings, the task is to check whether the frequencies of a character(for each character) in one string is a multiple or a factor… Read More »

Given a number N, the task is to find the smallest number not less than N, which has all digits odd. Examples: Input: N =… Read More »

Given a string str, the task is to count the number of alphabets having ascii in the range [l, r]. Examples: Input: str = “geeksforgeeks”… Read More »

Given an incomplete bracket sequence S. The task is to find the number of closing brackets ‘)’ needed to make it a regular bracket sequence… Read More »