Palindrome String Coding Problems

A string is called a palindrome if the reverse of the string is the same as the original one.

Example: “madam”, “racecar”, “12321”.

Properties of a Palindrome String:

A palindrome string has some properties which are mentioned below:

• A palindrome string has a symmetric structure which means that the character in the first half of the string are the same as in the rear half but in reverse order.
• Any string of length 1 is always a palindrome.

Easy Problems:

• Check if Palindrome
• Sentence Palindrome
• Palindromic binary representation
• Longest palindrome word
• All Palindrome Words
• Rearrange characters for palindrome
• Lexicographically first palindromic string
• Longest Non-palindromic substring
• Minimum insertions to form a palindrome
• Smallest Palindrome after replacement
• Remove character from string to make palindrome.
• Print all palindromes in a given range
• Sum of first K even-length Palindrome numbers

Medium Problems:

• Minimum removal to make palindrome permutation
• Character Positions for Palindrome Formation
• rotation of a palindrome
• largest palindrome by changing at most K-digits
• Minimum deletions to make string palindrome
• Longest palindrome by removing or shuffling chars
• Print all Palindrome permutations
• All Palindromic sub-strings
• Count Palindromic substrings in an Index range
• Longest Possible Chunked Palindrome
• Largest palindromic number by permuting digits
• Lexicographically smallest palindrome with minimal changes
• Strings of length N with no palindromic sub string
• Check if any anagram of a string is palindrome or not
• Count maximum-length palindromes
• Next greater palindromic number

Hard Problems:

• Minimum insertions to form a palindrome
• Longest Palindromic Substring
• Checking palindrome in a stream
• Palindrome Partitioning
• Print all palindromic partitions
• Count All Palindromic Subsequence
• Print Longest Palindromic Subsequence
• Minimum characters to add for palindrome string
• Palindrome Substring Queries
• Palindrome pair in an array of words
• Minimum steps to delete a string
• Next smallest palindrome
• Closest Palindrome Number
• Count palindromic characteristics of a String
• Number of valid insertions to form palindrome.
• Minimum Palindromic Cuts with Rearrangement
• Palindrome by swapping one character

Quick Links:

• Recent articles on Palindrome
• ‘Practice Problems’ on Strings
• ‘Quizzes’ on Strings