**Make a Palindrome by Inserting Characters - Google Top Interview Questions**

### Problem Statement :

Given a string s, return the minimum number of characters needed to be inserted so that the string becomes a palindrome. Constraints n ≤ 1,000 where n is the length of s Example 1 Input s = "radr" Output 1 Explanation We can insert "a" to get "radar"

### Solution :

` ````
Solution in C++ :
int solve(string s) {
int n = s.length();
int dp[n + 1][n + 1];
for (int i = 0; i <= n; i++) {
for (int j = 0; j <= n; j++) {
if (i == 0) {
dp[i][j] = j;
} else if (j == 0) {
dp[i][j] = i;
} else if (s[i - 1] == s[n - j]) {
dp[i][j] = dp[i - 1][j - 1];
} else {
dp[i][j] = 1 + min(dp[i][j - 1], dp[i - 1][j]);
}
}
}
return dp[n][n] / 2;
}
```

` ````
Solution in Java :
import java.util.*;
class Solution {
public int solve(String s) {
return s.length() - lps(s);
}
int lps(String st) {
char[] s = st.toCharArray();
int m = s.length;
int[][] dp = new int[m][m];
for (int i = 0; i < m; i++) dp[i][i] = 1;
for (int i = m - 1; i >= 0; i--) {
for (int j = i + 1; j < m; j++) {
if (s[i] == s[j]) {
dp[i][j] = dp[i + 1][j - 1] + 2;
} else {
dp[i][j] = Math.max(dp[i + 1][j], dp[i][j - 1]);
}
}
}
return dp[0][m - 1];
}
}
```

` ````
Solution in Python :
class Solution:
def solve(self, s):
"""
#1: Most popular approach: time and space complexity: O(n^2).
Let f[i][j] be the length of the longest palindromic subsequence in s[i:j+1]
f[i][j] = f[i+1][j-1] + 2 if s[i] == s[j]
= max(f[i+1][j], f[i][j-1]) otherwise
"""
n = len(s)
f = [[0] * n for _ in range(n)]
for size in range(1, n + 1):
for i in range(n - size + 1):
j = i + size - 1
if s[i] == s[j]:
if i + 1 > j - 1:
f[i][j] = size
else:
f[i][j] = f[i + 1][j - 1] + 2
else:
f[i][j] = max(f[i + 1][j], f[i][j - 1])
return n - f[0][n - 1]
"""
#2: A different transition function: time and space complexity: still O(n^2).
But this is a pathway to a better solution.
Let f[size][i] be the length of the longest palindromic subsequence in s[i:i+size]
f[size][i] = f[size-2][i+1] + 2 if s[i] == s[i+size-1]
= max(f[size-1][i+1], f[size-1][i]) otherwise
"""
n = len(s)
f = [[0] * n for _ in range(n + 1)]
for size in range(1, n + 1):
for i in range(n - size + 1):
j = i + size - 1
if s[i] == s[j]:
if size - 2 > 0:
f[size][i] = f[size - 2][i + 1] + 2
else:
f[size][i] = size
else:
f[size][i] = max(f[size - 1][i + 1], f[size - 1][i])
return n - f[n][0]
"""
#3: Based on #2, do rolling array to reduce space: time complexity: still O(n^2), space: O(n).
In #2, notice that f[size] only depends on f[size-1] and f[size-2], so instead of storing the whole
(n+1) arrays, we just need 3 arrays, f0, f1, f2. f0 is the current f[size], f1 is the f[size-1], and
f2 is the f[size-2].
"""
n = len(s)
f0 = [0] * n
f1 = [0] * n
f2 = [0] * n
for size in range(1, n + 1):
f0, f1, f2 = [0] * n, f0, f1
for i in range(n - size + 1):
j = i + size - 1
if s[i] == s[j]:
if size - 2 > 0:
f0[i] = f2[i + 1] + 2
else:
f0[i] = size
else:
f0[i] = max(f1[i + 1], f1[i])
return n - f0[0]
```

## View More Similar Problems

## Dynamic Array

Create a list, seqList, of n empty sequences, where each sequence is indexed from 0 to n-1. The elements within each of the n sequences also use 0-indexing. Create an integer, lastAnswer, and initialize it to 0. There are 2 types of queries that can be performed on the list of sequences: 1. Query: 1 x y a. Find the sequence, seq, at index ((x xor lastAnswer)%n) in seqList.

View Solution →## Left Rotation

A left rotation operation on an array of size n shifts each of the array's elements 1 unit to the left. Given an integer, d, rotate the array that many steps left and return the result. Example: d=2 arr=[1,2,3,4,5] After 2 rotations, arr'=[3,4,5,1,2]. Function Description: Complete the rotateLeft function in the editor below. rotateLeft has the following parameters: 1. int d

View Solution →## Sparse Arrays

There is a collection of input strings and a collection of query strings. For each query string, determine how many times it occurs in the list of input strings. Return an array of the results. Example: strings=['ab', 'ab', 'abc'] queries=['ab', 'abc', 'bc'] There are instances of 'ab', 1 of 'abc' and 0 of 'bc'. For each query, add an element to the return array, results=[2,1,0]. Fun

View Solution →## Array Manipulation

Starting with a 1-indexed array of zeros and a list of operations, for each operation add a value to each of the array element between two given indices, inclusive. Once all operations have been performed, return the maximum value in the array. Example: n=10 queries=[[1,5,3], [4,8,7], [6,9,1]] Queries are interpreted as follows: a b k 1 5 3 4 8 7 6 9 1 Add the valu

View Solution →## Print the Elements of a Linked List

This is an to practice traversing a linked list. Given a pointer to the head node of a linked list, print each node's data element, one per line. If the head pointer is null (indicating the list is empty), there is nothing to print. Function Description: Complete the printLinkedList function in the editor below. printLinkedList has the following parameter(s): 1.SinglyLinkedListNode

View Solution →## Insert a Node at the Tail of a Linked List

You are given the pointer to the head node of a linked list and an integer to add to the list. Create a new node with the given integer. Insert this node at the tail of the linked list and return the head node of the linked list formed after inserting this new node. The given head pointer may be null, meaning that the initial list is empty. Input Format: You have to complete the SinglyLink

View Solution →