## Check if the given string is the same as its reflection in a mirror

Given a string S containing only uppercase English characters. The task is to find whether S is the same as its reflection in a mirror.… Read More »

- Largest palindromic number in an array
- Program to check if an array is palindrome or not using Recursion
- Check if a string is palindrome in C using pointers
- Find the player who rearranges the characters to get a palindrome string first
- Largest palindromic prime in an array
- Program to check the number is Palindrome or not
- Check if a string contains a palindromic sub-string of even length
- Check if the characters in a string form a Palindrome in O(1) extra space
- Find next palindrome prime
- Check if it is possible to create a palindrome string from given N
- Rearrange the string to maximize the number of palindromic substrings
- Find the count of palindromic sub-string of a string in its sorted form
- Next smallest prime palindrome
- Make palindromic string non-palindromic by rearranging its letters
- Minimum number of characters to be replaced to make a given string Palindrome
- Minimum number of palindromes required to express N as a sum | Set 1
- Minimum number of palindromes required to express N as a sum | Set 2
- Count all Prime Length Palindromic Substrings
- Check if a number with even number of digits is palindrome or not
- Count all palindrome which is square of a palindrome
- Check if all elements of the array are palindrome or not
- Python program to check if given string is vowel Palindrome
- Find index i such that prefix of S1 and suffix of S2 till i form a palindrome when concatenated
- Generate number with given operation and check if it is palindrome
- Check if all the palindromic sub-strings are of odd length
- Check if suffix and prefix of a string are palindromes
- Sum of all odd length palindromic numbers within the range [L, R]
- Check if there exists any sub-sequence in a string which is not palindrome
- Maximum even length sub-string that is permutation of a palindrome
- Find a palindromic string B such that given String A is a subsequense of B

Given a string S containing only uppercase English characters. The task is to find whether S is the same as its reflection in a mirror.… Read More »

Given two strings A and B of equal lengths, the task is to find an index i such that A[0…i] and B[i+1…n-1] give a palindrome… Read More »

Given a string str containing lowercase alphabets (a – z). The task is to print the string after rearranging some characters such that the string… Read More »

Given a string str, the task is to count all the sub-strings of str which are palindromes and their length is prime. Examples: Input: str… Read More »

Given a string (may contain both vowel and consonant letters), remove all consonants, then check if the resulting string is palindrome or not. Examples: Input… Read More »

Given an integer N the task is to create a string out of it by repeating the number such that the length of the resultant… Read More »

Given an integer N, write a program that returns true if the given number is a palindrome, else return false. Examples: Input: N = 2002… Read More »

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 »