## Check if it is possible to create a palindrome string from given N

Given a number N. The task is to create an alphabetical string in lower case from that number and tell whether the string is palindrome… Read More »

- Java program to check whether a string is a Palindrome
- Distinct palindromic sub-strings of the given string using Dynamic Programming
- Count pairs of non-overlapping palindromic sub-strings of the given string
- Find the longest sub-string which is prefix, suffix and also present inside the string
- Maximum length palindromic substring such that it starts and ends with given char
- Find the time which is palindromic and comes after the given time
- Length of the longest substring that do not contain any palindrome
- Minimum length of the sub-string whose characters can be used to form a palindrome of length K
- Queries to check if substring[L...R] is palindrome or not
- TCP Client-Server Program to Check if a Given String is Palindrome
- Make lexicographically smallest palindrome by substituting missing characters
- 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 the number of digits of palindrome numbers in an array
- Count of three non-overlapping sub-strings which on concatenation forms a palindrome
- Check if string can be rearranged so that every Odd length Substring is Palindrome

Given a number N. The task is to create an alphabetical string in lower case from that number and tell whether the string is palindrome… Read More »

Given a string. The task is to check if the string is a palindrome or not using pointers. You are not allowed to use any… Read More »

Given a string S consisting of lowercase characters(a-z) only, the task is to print a new string by rearranging the string in such a way… Read More »

Given an array. The task is to determine whether an array is a palindrome or not using recursion. Examples: Input: arr[] = {3, 6, 0,… Read More »

Given a number N, we have to find the minimum number of palindromes required to express N as a sum of them. Examples: Input :… Read More »

Given a number N, we have to find the minimum number of palindromes required to express N as a sum of them. Examples: Input: N… Read More »

Given a number N containing even number of digits. The task is to check whether that number is palindrome or not. Examples: Input: N =… Read More »

Given a string str. The string may contain lower-case letters, special characters, digits or even white-spaces. The task is to check, whether only the letters… Read More »

Find the smallest palindrome number which is prime too and greater then given number N. Examples: Input : N = 7 Output :11 11 is… Read More »

Given a string of lowercase English alphabets, find the number of counterclockwise shifts of characters required to make the string palindrome. It is given that… Read More »

Given a string of lowercase characters, the task is to detect the family of string, where family of string is described as follows. ODD Palindrome… Read More »

Given a number, the task is to write a recursive function which checks if the given number is palindrome or not. Examples: Input : 121… Read More »

Given a positive number n. The task is to check if the mirror image of the number is equal to given number or not if… Read More »

Given a string, the task is to check if the string can be made palindrome by swapping a character only once. [NOTE: only one swap… Read More »

Given a string, the task is to find all the palindromic sub-strings from the given string. In Set – 1, another approach has been already… Read More »