## Longest Palindromic Substring using Palindromic Tree | Set 3

Given a string, find the longest substring which is palindrome. For example, if the given string is “forgeeksskeegfor”, the output should be “geeksskeeg”. Prerequisite :… Read More »

- Program to check if an Array is Palindrome or not
- Count pairs of non-overlapping palindromic sub-strings of the given string
- Distinct palindromic sub-strings of the given string using Dynamic Programming
- Find the time which is palindromic and comes after the given time
- Maximum length palindromic substring such that it starts and ends with given char
- Make palindromic string non-palindromic by rearranging its letters
- Find the longest sub-string which is prefix, suffix and also present inside the string
- Count all Prime Length Palindromic Substrings
- Minimum cuts required to convert a palindromic string to a different palindromic string
- Program to check if an Array is Palindrome or not using STL in C++
- Smallest and Largest Palindrome with N Digits
- Find index i such that prefix of S1 and suffix of S2 till i form a palindrome when concatenated
- Length of the longest substring that do not contain any palindrome
- Queries to check if substring[L...R] is palindrome or not
- Make lexicographically smallest palindrome by substituting missing characters
- Check if the given string is the same as its reflection in a mirror
- Minimum length of the sub-string whose characters can be used to form a palindrome of length K
- Maximum length palindrome that can be created with characters in range L and R
- Count the nodes of the given tree whose weighted string is a palindrome
- Sum of all palindrome numbers present in an Array
- Count of three non-overlapping sub-strings which on concatenation forms a palindrome
- Count the number of digits of palindrome numbers in an array
- Longest double string from a Palindrome
- Check if Matrix remains unchanged after row reversals

Given a string, find the longest substring which is palindrome. For example, if the given string is “forgeeksskeegfor”, the output should be “geeksskeeg”. Prerequisite :… Read More »

Given a string s of length n, count the number of substrings having different types of palindromic characteristics. Palindromic Characteristic is the number of k-palindromes… Read More »

Given a string str and the task is to count palindrome words present in the string str. Examples: Input : Madam Arora teaches malayalam Output… Read More »

Given N(very large), task if to print the largest palindromic number obtained by permuting the digits of N. If it is not possible to make… Read More »

Given n and k, Construct a palindrome of size n using a binary number of size k repeating itself to wrap into the palindrome. The… Read More »

Given a string str, find count of all palindromic permutations of it. Examples : Input : str = “gfgf” Output : 2 There are two… Read More »

You are given a string s(only lowercase alphabets) with length n. Print the position of every character of the String it must acquire so that… Read More »

Given two positive integers N, M. The task is to find the number of strings of length N under the alphabet set of size M… Read More »

Given a String s, count all special palindromic substrings of size greater than 1. A Substring is called special palindromic substring if all the characters… Read More »

Given a number N. our task is to find the closest Palindrome number whose absolute difference with given number is minimum and absolute difference must… Read More »

Given a string S, we have to find minimum characters that we can remove to make any permutation of the string S a palindrome. In… Read More »

Given a sentence str. The problem is to remove all the palindromic words from the given sentence. Examples: Input : str = “Text contains malayalam… Read More »

Given a string, convert the string to palindrome without any modifications like adding a character, removing a character, replacing a character etc. Examples: Input :… Read More »

Given a string str. Check if it is possible to convert the string into palindrome string by changing only one character. Examples: Input : str… Read More »

Given a string, count how many maximum-length palindromes are present.(It need not be a substring) Examples: Input : str = “ababa” Output: 2 Explanation :… Read More »