## Minimum cuts required to convert a palindromic string to a different palindromic string

Given palindromic string s, the task is to find minimum k, such that you can cut this string into k+1 parts, and then unite them… Read More »

- Program to check if an Array is Palindrome or not
- Count pairs of non-overlapping palindromic sub-strings of the given string
- Distinct palindromic sub-strings of the given string using Dynamic Programming
- Find the time which is palindromic and comes after the given time
- Make palindromic string non-palindromic by rearranging its letters
- Count all Prime Length Palindromic Substrings
- Minimum cuts required to convert a palindromic string to a different palindromic 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
- Program to check if an Array is Palindrome or not using STL in C++
- Find index i such that prefix of S1 and suffix of S2 till i form a palindrome when concatenated
- Smallest and Largest Palindrome with N Digits
- Length of the longest substring that do not contain any palindrome
- Queries to check if substring[L...R] is palindrome or not
- Check if the given string is the same as its reflection in a mirror
- Make lexicographically smallest palindrome by substituting missing characters
- Minimum length of the sub-string whose characters can be used to form a palindrome of length K
- 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
- Count of three non-overlapping sub-strings which on concatenation forms a palindrome
- Sum of all palindrome numbers present in an Array
- Count the number of digits of palindrome numbers in an array
- Longest double string from a Palindrome
- Check if Matrix remains unchanged after row reversals

Given palindromic string s, the task is to find minimum k, such that you can cut this string into k+1 parts, and then unite them… Read More »

Given a NxN matrix. The task is to check if after reversing all of the rows of the given Matrix, the matrix remains same or… Read More »

Given a number N. The task is to find the smallest and largest palindromic number possible with N digits. Examples: Input: N = 4 Output:… Read More »

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

Given a palindrome String, the task is to find the maximum length of the double string and its length that can be obtained from the… Read More »

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 »