## Print all possible palindromic string formed using any pair of given strings

Given an array of strings arr[] containing N words, the task is to print all possible palindromic string by combining any two strings from the… Read More »

- Check if sum of any subarray is Palindrome or not
- Shortest Palindromic Substring
- Longest Palindrome in a String formed by concatenating its prefix and suffix
- Sum of all Palindrome Numbers present in a Linked list
- Count of palindromic plus paths in a given Matrix
- Check if Inorder traversal of a Binary Tree is palindrome or not
- Longest palindrome formed by concatenating and reordering strings of equal length
- Count minimum swap to make string palindrome
- Count of K-size substrings having palindromic permutations
- Find if string is K-Palindrome or not using all characters exactly once
- Print all Palindromic Levels Of a Binary Tree
- Minimum length of substring whose rotation generates a palindromic substring
- Count of root to leaf paths whose permutation is palindrome in a Binary Tree
- Largest palindrome which is product of two N-digit numbers : Set 2
- Longest palindromic String formed using concatenation of given strings in any order
- Print the longest palindromic prefix of a given string
- Permutation of given string that maximizes count of Palindromic substrings
- Make the string lexicographically smallest and non palindromic by replacing exactly one character
- Check if a substring can be Palindromic by replacing K characters for Q queries
- Count of N digit palindromic numbers divisible by 9
- Check if an array has some palindromic subsequence of length at least 3
- Check if K palindromic strings can be formed from a given string
- Check if longest connected component forms a palindrome in undirected graph
- Count of leaf nodes of the tree whose weighted string is a palindrome
- Make a palindromic string from given string
- Check whether the number can be made palindromic after adding K
- Longest Palindromic Subsequence of two distinct characters
- Check if string remains palindrome after removing given number of characters
- Count of odd length contiguous Palindromic sequences in a Matrix
- Sum of all palindromic numbers lying in the range [L, R] for Q queries

Given an array of strings arr[] containing N words, the task is to print all possible palindromic string by combining any two strings from the… Read More »

Given a string str, the task is to check if the given string is Even-Odd Palindrome or not. An Even-Odd Palindrome string is defined to… Read More »

Given a string S, the task is to find the number of ways to split the given string S into two non-empty palindromic strings. Examples:… Read More »

Given string str, the task is to check if characters at the odd indexes of str form a palindrome string or not. If not then… Read More »

Given a matrix mat[][], the task is to check that the sum of the elements of the matrix is prime or not. Examples: Input: mat[][]… Read More »

A Tetradic Primes are prime numbers that are also tetradic number. A tetradic Number is a palindromic number containing only 0, 1, and 8 as… Read More »

A Tetradic Number (sometimes called a four-way number) is a number that remains the same when flipped back-front, mirrored up-down, or flipped up-down. In other… Read More »

A Belphegor number is a palindromic number such that the number is of form 1(0…)666(0…)1 The Nth Belphegor number is given by: Check if N… Read More »

Given a string str, the task is to check if it is possible to split the given string into even length palindromic substrings. Examples: Input:… Read More »

Given a string str, the task is to remove all the consecutive duplicates from the string str and check if the final string is palindrome… Read More »

Given an array of strings arr[], the task is to count the pair of strings whose concatenation of substrings form a palindrome. Examples: Input: arr[]… Read More »

Given a matrix mat[][] with N rows and M columns. The task is to find the minimum number of changes required in the matrix such… Read More »

Given a matrix mat[][], the task is to check if the row-major order path of the matrix is a palindrome or not. Examples: Input: mat[][]… Read More »

Given two positive integers N and M, the task is to calculate the number of non-palindromic strings of length M using given N distinct characters.… Read More »