## Manacher’s Algorithm – Linear Time Longest Palindromic Substring – Part 1

Given a string, find the longest substring which is palindrome. if the given string is “forgeeksskeegfor”, the output should be “geeksskeeg” if the given string… Read More »

## Check if characters of a given string can be rearranged to form a palindrome

Given a string, Check if characters of the given string can be rearranged to form a palindrome. For example characters of “geeksogeeks” can be rearranged… Read More »

## C++ Program to print all palindromes in a given range

Given a range of numbers, print all palindromes in the given range. For example if the given range is {10, 115}, then output should be… Read More »

## Check if a given string is a rotation of a palindrome

Given a string, check if it is a rotation of a palindrome. For example your function should return true for “aab” as it is a… Read More »

## C Program to Check if a Given String is Palindrome

Given a string, write a c function to check if it is palindrome or not. A string is said to be palindrome if reverse of… Read More »

## Minimum insertions to form a palindrome | DP-28

Given a string, find the minimum number of characters to be inserted to convert it to palindrome. Before we go further, let us understand with… Read More »

## Check if a number is Palindrome

Given an integer, write a function that returns true if the given number is palindrome, else false. For example, 12321 is palindrome, but 1451 is… Read More »

## Facebook Interview | Set 1

I am a final year student of IIT Guwahati and the first phase of placements has just finished at our college. I was recruited by… Read More »

## Longest Palindromic Substring | Set 2

Given a string, find the longest substring which is palindrome. For example, if the given string is “forgeeksskeegfor”, the output should be “geeksskeeg”. Recommended: Please… Read More »

## Given a number, find the next smallest palindrome

Given a number, find the next smallest palindrome larger than this number. For example, if the input number is “2 3 5 4 5”, the… Read More »

## Palindrome Partitioning | DP-17

Given a string, a partitioning of the string is a palindrome partitioning if every substring of the partition is a palindrome. For example, “aba|b|bbabb|a|b|aba” is… Read More »

## Longest Palindromic Subsequence | DP-12

Given a sequence, find the length of the longest palindromic subsequence in it. As another example, if the given sequence is “BBABCBCAB”, then the output… Read More »

## Function to check if a singly linked list is palindrome

Given a singly linked list of characters, write a function that returns true if the given list is palindrome, else false. Recommended: Please solve it… Read More »