## Find a palindromic string B such that given String A is a subsequense of B

Given a string . Find a string , where B is a palindrome and A is a subsequence of B. A subsequence of a string… Read More »

- Count common characters in two strings
- Repeated Character Whose First Appearance is Leftmost
- Convert character array to string in C++
- Count substrings that contain all vowels | SET 2
- Find the longest string that can be made up of other strings from the array
- Minimum number of times A has to be repeated such that B is a substring of it
- Count of integers of length N and value less than K such that they contain digits only from the given set
- Check for balanced parentheses in an expression | O(1) space | O(N^2) time complexity
- Check whether two strings contain same characters in same order
- Rearrange characters in a string such that no two adjacent are same using hashing
- Generate all permutations of a string that follow given constraints
- Program to find the kth character after decrypting a string
- Java program to check whether a string is a Palindrome
- Check if two strings are same ignoring their cases
- Minimum number of adjacent swaps to convert a string into its given anagram
- Maximize the happiness of the groups on the Trip
- Distinct palindromic sub-strings of the given string using Dynamic Programming
- Program to generate all possible valid IP addresses from given string | Set 2
- Find the number of binary strings of length N with at least 3 consecutive 1s
- InfyTQ 2019 : Find the position from where the parenthesis is not balanced
- Implement a Dictionary using Trie
- Minimum rotations required to get the same String | Set-2
- Check if a string can be obtained by rotating another string d places
- Count pairs of non-overlapping palindromic sub-strings of the given string
- Append a digit in the end to make the number equal to the length of the remaining string
- Count of substrings which contains a given character K times
- C++ program to compare two Strings using Operator Overloading
- Minimum number of sub-strings of a string such that all are power of 5
- Reverse individual words with O(1) extra space
- Persistent Trie | Set 1 (Introduction)

Given a string . Find a string , where B is a palindrome and A is a subsequence of B. A subsequence of a string… Read More »

Given a string , the task is to check if the frequencies of all the characters of the string are prime or not. If all… Read More »

Given a size as n, The task is to generate a random alphanumeric String of this size. Below are various ways to generate random alphanumeric… Read More »

Given an even length string S consisting of lower-case English alphabets only, we have two players playing the game. The rules are as follows: the… Read More »

Given a string containing lowercase English alphabets. The task is to find the minimum number of characters needed to be removed so that the remaining… Read More »

Given a string of length consisting of lowercase alphabets. The task is to find the number of such substrings whose characters occur in alphabetical order.… Read More »

Given an integer n and an array of characters S, the task is to generate Lyndon words of length n having characters from S. A… Read More »

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

Given a sentence, the task is to find the average of ASCII values of each word in the sentence and print it with the word.… Read More »

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 »