## Number of strings of length N with no palindromic sub string

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 »

## Count special palindromes in a String

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 »

## Closest Palindrome Number (absolute difference Is min)

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 »

## Minimum removal to make palindrome permutation

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 »

## Remove all the palindromic words from the given sentence

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 »

## Rearrange characters to form palindrome if possible

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 »

## Convert the string into palindrome string by changing only one character.

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 »

## Count maximum-length palindromes in a String

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 »

## Make a lexicographically smallest palindrome with minimal changes

Given a string S. Print the lexicographically smallest string possible. You can make minimal changes to the characters in the string and you can permute… Read More »

## Longest palindrome subsequence with O(n) space

Given a sequence, find the length of the longest palindromic subsequence in it. Examples: Input : abbaab Output : 4 Input : geeksforgeeks Output :… Read More »

## Bash program to check if the Number is a Palindrome

Given a number num, find whether the given number is palindrome or not using Bash Scripting. Examples: Input : 666 Output : Number is palindrome… Read More »

## Palindromic Selfie Numbers

Given a number x, find it’s palindromic selfie number according to selfie multiplicative rule. If such a number doesn’t exist, then print “No such number… Read More »

## Check if actual binary representation of a number is palindrome

Given a non-negative integer n. The problem is to check if binary representation of n is palindrome or not. Note that the actual binary representation… Read More »

## Print all the palindromic permutations of given string in alphabetic order

Given a string str of size n. The problem is to print all the palindromic permutations of str in alphabetic order if possible else print… Read More »

## Minimum equal palindromic cuts with rearrangements allowed

Given a string of length n. Find the minimum number of possible cuts after rearranging the string (if required), such that each cut is a… Read More »