Python Program To Find Minimum Insertions To Form A Palindrome | DP-28
Last Updated : 18 May, 2023
Given string str, the task is to find the minimum number of characters to be inserted to convert it to a palindrome.
Before we go further, let us understand with a few examples:
- ab: Number of insertions required is 1 i.e. bab
- aa: Number of insertions required is 0 i.e. aa
- abcd: Number of insertions required is 3 i.e. dcbabcd
- abcda: Number of insertions required is 2 i.e. adcbcda which is the same as the number of insertions in the substring bcd(Why?).
- abcde: Number of insertions required is 4 i.e. edcbabcde
Let the input string be str[l……h]. The problem can be broken down into three parts:
- Find the minimum number of insertions in the substring str[l+1,…….h].
- Find the minimum number of insertions in the substring str[l…….h-1].
- Find the minimum number of insertions in the substring str[l+1……h-1].
Recursive Approach: The minimum number of insertions in the string str[l…..h] can be given as:
- minInsertions(str[l+1…..h-1]) if str[l] is equal to str[h]
- min(minInsertions(str[l…..h-1]), minInsertions(str[l+1…..h])) + 1 otherwise
Below is the implementation of the above approach:
Python 3 # A Naive recursive program to find # minimum number insertions needed # to make a string palindrome import sys # Recursive function to find # minimum number of insertions def findMinInsertions(str, l, h): # Base Cases if (l > h): return sys.maxsize if (l == h): return 0 if (l == h - 1): return 0 if(str[l] == str[h]) else 1 # Check if the first and last characters # are same. On the basis of the comparison # result, decide which subproblem(s) to call if(str[l] == str[h]): return findMinInsertions(str, l + 1, h - 1) else: return (min(findMinInsertions(str, l, h - 1), findMinInsertions(str, l + 1, h)) + 1) # Driver Code if __name__ == "__main__": str = "geeks" print(findMinInsertions(str, 0, len(str) - 1)) # This code is contributed by ita_c
Output:
3
Time Complexity: O(2^n), where n is the length of the input string. This is because for each recursive call, there are two possibilities: either we insert a character at the beginning of the string or at the end of the string. Therefore, the total number of recursive calls made is equal to the number of binary strings of length n, which is 2^n.
Memoization based approach(Dynamic Programming):
If we observe the above approach carefully, we can find that it exhibits overlapping subproblems.
Suppose we want to find the minimum number of insertions in string "abcde":
abcde / | / | bcde abcd bcd <- case 3 is discarded as str[l] != str[h] / | / | / | / | cde bcd cd bcd abc bc / | / | /| / | de cd d cd bc c………………….
The substrings in bold show that the recursion is to be terminated and the recursion tree cannot originate from there. Substring in the same color indicates overlapping subproblems.
This gave rise to use dynamic programming approach to store the results of subproblems which can be used later. In this apporach we will go with memoised version and in the next one with tabulation version.
Algorithm:
- Define a function named findMinInsertions which takes a character array str, a two-dimensional vector dp, an integer l and an integer h as arguments.
- If l is greater than h, then return INT_MAX as this is an invalid case.
- If l is equal to h, then return 0 as no insertions are needed.
- If l is equal to h-1, then check if the characters at index l and h are same. If yes, then return 0 else return 1. Store the result in the dp[l][h] matrix.
- If the value of dp[l][h] is not equal to -1, then return the stored value.
- Check if the first and last characters of the string str are same. If yes, then call the function findMinInsertions recursively by passing arguments str, dp, l+1, and h-1.
- If the first and last characters of the string str are not same, then call the function findMinInsertions recursively by passing arguments str, dp, l, and h-1 and also call the function recursively by passing arguments str, dp, l+1, and h. The minimum of the two calls is the answer. Add 1 to it, as one insertion is required to make the string palindrome. Store this result in the dp[l][h] matrix.
- Return the result stored in the dp[l][h] matrix.
Below is the implementation of the approach:
Python3 # Python3 program to find minimum # number insertions needed to make a string # palindrome # Function to find minimum number # of insertions def findMinInsertions(s, dp, l, h): # Base Cases if l > h: return float('inf') if l == h: return 0 if l == h - 1: dp[l][h] = 0 if s[l] == s[h] else 1 return dp[l][h] if dp[l][h] != -1: return dp[l][h] # Check if the first and last characters # are same. On the basis of the comparison # result, decide which subproblem(s) to call if s[l] == s[h]: dp[l][h] = findMinInsertions(s, dp, l + 1, h - 1) else: dp[l][h] = min(findMinInsertions(s, dp, l, h - 1), findMinInsertions(s, dp, l + 1, h)) + 1 return dp[l][h] # Driver code if __name__ == "__main__": s = "geeks" n = len(s) # Initialize dp array dp = [[-1] * n for _ in range(n)] # Function call print(findMinInsertions(s, dp, 0, n - 1)) # This code is contributed by Chandramani Kumar Time complexity: O(N^2) where N is size of input string.
Auxiliary Space: O(N^2) as 2d dp array has been created to store the states. Here, N is size of input string.
Dynamic Programming based Solution
If we observe the above approach carefully, we can find that it exhibits overlapping subproblems.
Suppose we want to find the minimum number of insertions in string "abcde":
abcde / | / | bcde abcd bcd <- case 3 is discarded as str[l] != str[h] / | / | / | / | cde bcd cd bcd abc bc / | / | /| / | de cd d cd bc c………………….
The substrings in bold show that the recursion is to be terminated and the recursion tree cannot originate from there. Substring in the same color indicates overlapping subproblems.
How to re-use solutions of subproblems? The memorization technique is used to avoid similar subproblem recalls. We can create a table to store the results of subproblems so that they can be used directly if the same subproblem is encountered again.
The below table represents the stored values for the string abcde.
a b c d e ---------- 0 1 2 3 4 0 0 1 2 3 0 0 0 1 2 0 0 0 0 1 0 0 0 0 0
How to fill the table?
The table should be filled in a diagonal fashion. For the string abcde, 0….4, the following should be ordered in which the table is filled:
Gap = 1: (0, 1) (1, 2) (2, 3) (3, 4) Gap = 2: (0, 2) (1, 3) (2, 4) Gap = 3: (0, 3) (1, 4) Gap = 4: (0, 4)
Below is the implementation of the above approach:
Python3 # A Dynamic Programming based program to # find minimum number insertions needed # to make a string palindrome # A utility function to find minimum # of two integers def Min(a, b): return min(a, b) # A DP function to find minimum number # of insertions def findMinInsertionsDP(str1, n): # Create a table of size n*n. table[i][j] # will store minimum number of insertions # needed to convert str1[i..j] to a # palindrome. table = [[0 for i in range(n)] for i in range(n)] l, h, gap = 0, 0, 0 # Fill the table for gap in range(1, n): l = 0 for h in range(gap, n): if str1[l] == str1[h]: table[l][h] = table[l + 1][h - 1] else: table[l][h] = (Min(table[l][h - 1], table[l + 1][h]) + 1) l += 1 # Return minimum number of insertions # for str1[0..n-1] return table[0][n - 1]; # Driver Code str1 = "geeks" print(findMinInsertionsDP(str1, len(str1))) # This code is contributed by Mohit kumar 29
Output:
3
Time complexity: O(N^2)
Auxiliary Space: O(N^2)
Another Dynamic Programming Solution (Variation of Longest Common Subsequence Problem)
The problem of finding minimum insertions can also be solved using Longest Common Subsequence (LCS) Problem. If we find out the LCS of string and its reverse, we know how many maximum characters can form a palindrome. We need to insert the remaining characters. Following are the steps.
- Find the length of LCS of the input string and its reverse. Let the length be 'l'.
- The minimum number of insertions needed is the length of the input string minus 'l'.
Below is the implementation of the above approach:
Python3 # An LCS based Python3 program to find minimum # number insertions needed to make a string # palindrome """ Returns length of LCS for X[0..m-1], Y[0..n-1]. See http://goo.gl/bHQVP for details of this function """ def lcs(X, Y, m, n) : L = [[0 for i in range(n + 1)] for j in range(m + 1)] """ Following steps build L[m + 1, n + 1] in bottom up fashion. Note that L[i, j] contains length of LCS of X[0..i - 1] and Y[0..j - 1] """ for i in range(m + 1) : for j in range(n + 1) : if (i == 0 or j == 0) : L[i][j] = 0 elif (X[i - 1] == Y[j - 1]) : L[i][j] = L[i - 1][j - 1] + 1 else : L[i][j] = max(L[i - 1][j], L[i][j - 1]) """ L[m,n] contains length of LCS for X[0..n-1] and Y[0..m-1] """ return L[m][n] # LCS based function to find minimum number # of insertions def findMinInsertionsLCS(Str, n) : # Using charArray to reverse a String charArray = list(Str) charArray.reverse() revString = "".join(charArray) # The output is length of string minus # length of lcs of str and it reverse return (n - lcs(Str, revString , n, n)) # Driver code Str = "geeks" print(findMinInsertionsLCS(Str,len(Str))) # This code is contributed by divyehrabadiya07
Output:
3
Time complexity: O(N^2)
Auxiliary Space: O(N^2)
Please refer complete article on Minimum insertions to form a palindrome | DP-28 for more details!
Similar Reads
Python Program To Check If A Linked List Of Strings Forms A Palindrome
Given a linked list handling string data, check to see whether data is palindrome or not? Examples: Input: a -> bc -> d -> dcb -> a -> NULL Output: True String "abcddcba" is palindrome. Input: a -> bc -> d -> ba -> NULL Output: False String "abcdba" is not palindrome. Reco
2 min read
Python Program to Check if a String is Palindrome or Not
The task of checking if a string is a palindrome in Python involves determining whether a string reads the same forward as it does backward. For example, the string "madam" is a palindrome because it is identical when reversed, whereas "hello" is not. Using two pointer techniqueThis approach involve
3 min read
Python program to check if number is palindrome (one-liner)
In this article, we are given a number and we have to check whether the number is palindrome or not in one-liner code. The output will be True if it's a Palindrome number otherwise it would be False. Let's discuss how to find whether a number is palindrome or not in this article. Input1: test_number
3 min read
Python Program to Remove Palindromic Elements from a List
Given a list, the task here is to write Python programs that can remove all the elements which have palindromic equivalent element present in the list. Examples: Input : test_list = [54, 67, 12, 45, 98, 76, 9] Output : [12, 98] Explanation : 67 has 76 as palindromic element, both are omitted. Input
2 min read
Python Program 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 a palindrome, else false. Recommended: Please solve it on "PRACTICE" first, before moving on to the solution. METHOD 1 (Use a Stack): A simple solution is to use a stack of list nodes. This mainly invol
6 min read
Python Program to find all Palindromic Bitlists in length
In this article, we will learn to generate all Palindromic Bitlists of a given length using Backtracking in Python. Backtracking can be defined as a general algorithmic technique that considers searching every possible combination in order to solve a computational problem. Whereas, Bitlists are list
6 min read
Python Program For Checking Linked List With A Loop Is Palindrome Or Not
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. Examples: Input: 1 -> 2 -> 3 -> 2 /| |/ ------- 1 Output: Palindrome Linked list is 1 2 3 2 1 which is a palindrome. Input: 1 -> 2 -> 3 -> 4 /| |/ ------- 1
4 min read
Python program to sort Palindrome Words in a Sentence
Given a string S representing a sentence, the task is to reorder all the palindromic words present in the sentence in sorted order. Examples: Input: S = "Please refer to the madam to know the level"Output: Please level to the madam to know the referExplanation: Here "refer", "madam", "level" are the
5 min read
Python program to check whether number formed by combining all elements of the array is palindrome
Given an array arr[], the task is to combine all the elements in the array sequentially and check if it is a palindrome. Examples: Input: arr[] ={1 , 69 , 54 , 45 , 96 , 1} Output: palindrome Explanation: The number formed by combining all the elements is "1695445961" which is a palindrome Input: ar
4 min read
Python Program To Check String Is Palindrome Using Stack
A palindrome is a sequence of characters that reads the same backward as forward. Checking whether a given string is a palindrome is a common programming task. In this article, we will explore how to implement a Python program to check if a string is a palindrome using a stack. Example Input: str =
3 min read