## Count of three non-overlapping sub-strings which on concatenation forms a palindrome

Given a string str, the task is to count the number of ways a palindromic sub-string could be formed by concatenation of three sub-strings x,… Read More »

- Program to check the number is Palindrome or not
- Count pairs of non-overlapping palindromic sub-strings of the given string
- Program to check if an Array is Palindrome or not
- Find the time which is palindromic and comes after the given time
- Largest palindromic prime in an array
- Make palindromic string non-palindromic by rearranging its letters
- Python program to check if given string is vowel Palindrome
- Distinct palindromic sub-strings of the given string using Dynamic Programming
- Count all Prime Length Palindromic Substrings
- Minimum cuts required to convert a palindromic string to a different palindromic string
- Check if all elements of the array are palindrome or not
- Find the longest sub-string which is prefix, suffix and also present inside the string
- Smallest and Largest Palindrome with N Digits
- Find index i such that prefix of S1 and suffix of S2 till i form a palindrome when concatenated
- Program to check if an Array is Palindrome or not using STL in C++
- 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
- Length of the longest substring that do not contain any palindrome
- 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
- Generate number with given operation and check if it is palindrome
- 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 the number of digits of palindrome numbers in an array
- Sum of all palindrome numbers present in an Array
- Check if Matrix remains unchanged after row reversals
- Longest double string from a Palindrome
- Count of three non-overlapping sub-strings which on concatenation forms a palindrome

Given a string str, the task is to count the number of ways a palindromic sub-string could be formed by concatenation of three sub-strings x,… Read More »

Given an array arr[] with N integers. The task is to count all the digits of all palindrome numbers present in the array. Examples: Input:… Read More »

Given an array arr[] of N positive integers. The task is to find the sum of all palindrome numbers present in the array. Print the… Read More »

Given a tree, and the weights (in the form of strings) of all the nodes, the task is to count the nodes whose weights are… Read More »

Given a string str which stores the time in the 24 hours format as HH:MM such that 0 ≤ HH ≤ 23 and 0 ≤… Read More »

Given a string str of lowercase alphabets, the task is to find all distinct palindromic sub-strings of the given string. Examples: Input: str = “abaaa”… Read More »

Given a string of lowercase, find the length of the longest substring that does not contain any palindrome as a substring. Examples: Input : str… Read More »

Given a string str some of whose characters are missing and are represented by a ‘*’. The task is to substitute the missing characters so… Read More »

Given a string str and Q queries. Each query consists of two numbers L and R. The task is to find the maximum length palindrome… Read More »

Given a string str consisting of lowercase English letters and an integer K. The task is to find the minimum length of the sub-string whose… Read More »

Given a string S. The task is to count the non-overlapping pairs of palindromic sub-strings S1 and S2 such that the strings should be S1[L1…R1]… Read More »

Given a string str and Q queries. Every query consists of two numbers L and R. The task is to print if the sub-string[L…R] is… Read More »

Given a string str. The task is to find the longest sub-string which is a prefix, a suffix and a sub-string of the given string,… Read More »

Given an array, the task is to determine whether an array is a palindrome or not, using STL in C++. Examples: Input: arr[] = {3,… Read More »

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 »