## Check if all elements of the array are palindrome or not

Given an array arr[] of N elements. The task is to check if the array is PalinArray or not i.e., if all elements of array… 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 an array arr[] of N elements. The task is to check if the array is PalinArray or not i.e., if all elements of array… Read More »

Given an array arr[] of integers, the task is to print the largest palindromic prime from the array. If no element from the array is… Read More »

Given an array of non-negative integers arr[]. The task is to find the largest number in the array which is palindrome. If no such number… Read More »

Given a string , the task is to find the maximum length of the sub-string of that can be arranged into a Palindrome (i.e at… Read More »

Given a string str, the task is to find the minimum number of characters to be replaced to make a given string palindrome. Replacing a… Read More »

Given two integers and , the task is to find the sum of all the palindromic numbers within the range [L, R] which are of… Read More »

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 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 str consisting of lowercase English alphabets, the task is to find the total number of palindromic sub-strings present in the sorted form… Read More »

S is string containing only lowercase English alphabets. We need to find if there exists at least one palindromic sub-string whose length is even. Examples:… Read More »

Given a positive integer N where . The task is to find the smallest prime palindrome greater than or equal to N. Examples: Input: 8… Read More »

Given two positive integers L and R (represented as strings) where . The task is to find the total number of super-palindromes in the inclusive… Read More »

Given a string ‘s’ check if all of its palindromic sub-strings are of odd length or not. If yes then print “YES” or “NO” otherwise.… Read More »

Given a string ‘s’, the task is to check whether the string has both prefix and suffix substrings of length greater than 1 which are… Read More »

Given a string of lowercase English alphabets. The task is to check if there exists any subsequence in the string which is not a palindrome.… Read More »