In this article, we are given a string, our task is to find string is palindrome or not. A palindrome is a series of numbers, strings, or letters that, when read from right to left and left to right, match each other exactly or produce the same series of characters. in simple words when number strings or characters are inverted and still provide the same outcome as the original numbers or characters....
We will understand how to check whether a given value is a palindrome or not in JavaScript. A palindrome is a value that reads the same from backward or forward....
Given a singly linked list of characters, write a function that returns true if the given list is a palindrome, else false....
Given a linked list with a loop, the task is to find whether it is palindrome or not. You are not allowed to remove the loop....
Given an array of strings arr[] of size N where each string consists only of lowercase English letter. The task is to find all palindromic string in the array. Print -1 if no palindrome is present in the given array....
Given a singly linked list of characters, write a function that returns true if the given list is a palindrome, else false....
Given a string S of length N containing only lowercase alphabets, the task is to print the count of substrings of the given string whose anagram is palindromic....
Given two strings str1 and str2, the task is to check if it is possible to form a Palindromic String by concatenation of two substrings of str1 and str2....
Given a palindromic string str containing only lowercase letters, the task is to print the lexicographically smallest string, by replacing exactly one character, such the string is not a palindrome....
Given an array of strings arr[] of the same length, the task is to find the longest palindromic string that can be made using the concatenation of strings in any order....
Given a string str of lowercase alphabets, the task is to find all distinct palindromic sub-strings of the given string....
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....
