Find the minimum number of deletions required to convert a string into a palindrome
Given a string, find the minimum number of deletions required to convert it into a palindrome.
Category: String
Find all lexicographically previous permutations of a string
Given a string sorted in descending order, find all lexicographically previous permutations of it. In the lexicographic order, the words are arranged similarly as they are presumed to appear in a dictionary.
Check a string for repeated substrings
Given a string, check if it has a substring that can be used to construct the string by concatenating multiple copies of it.
Find difference between two strings
Given two strings, where the second string is constructed using all characters of the first string except one, find the character that was skipped in the second string.
Convert an infix expression into a postfix expression
Given an infix expression, convert it to the postfix expression. Assume that the infix expression is a string of tokens without any spaces.
Find correct order of alphabets in a given dictionary of ancient origin
Given a dictionary of ancient origin where the words are arranged alphabetically, find the correct order of alphabets in the ancient language.
Check if a linked list of strings is palindromic
Given a linked list of strings, check whether the concatenation of all values in the list together forms a palindrome. It is not permissible to construct a string out of the linked list nodes and check that string for palindrome.
Find all n-digit numbers with equal sum of digits at even and odd indices
Find all n–digit numbers with an equal sum of digits at even and odd index, where n varies from 1 to 9.
Construct the longest palindrome by shuffling or deleting characters from a string
Write an efficient algorithm to construct the longest palindrome by shuffling or deleting characters from a given string.
Replace all non-overlapping occurrences of a pattern
Given a string and a pattern, in-place replace all non-overlapping occurrences of the pattern in the string by a specified character.
Find the first non-repeating character in a string by doing only one traversal of it
Given a string, find the first non-repeating character in it by doing only one traversal of it.
Remove all adjacent duplicates from a string
Given a string, remove all adjacent duplicates from it. The algorithm should continue removing adjacent duplicates from the string till no duplicate is present in the result.