Skip to content
Related Articles

Related Articles

Improve Article
Minimum insertions to form a palindrome with permutations allowed
  • Difficulty Level : Easy
  • Last Updated : 14 May, 2021

Given a string of lowercase letters. Find minimum characters to be inserted in the string so that it can become palindrome. We can change the positions of characters in the string.
Examples: 
 

Input : geeksforgeeks
Output : 2
geeksforgeeks can be changed as:
geeksroforskeeg
geeksorfroskeeg
and many more

Input : aabbc
Output : 0
aabbc can be changed as:
abcba
bacab

 

A palindromic string can have one odd character only when the length of the string is odd otherwise all characters occur an even number of times. So, we have to find characters that occur at odd times in a string.
The idea is to count the occurrence of each character in a string. As palindromic string can have one character which occurs odd times, so the number of insertion will be one less than the count of characters which occur odd times. And if the string is already palindrome, we do not need to add any character, so the result will be 0. 
 

C++




// CPP program to find minimum number
// of insertions to make a string
// palindrome
#include <bits/stdc++.h>
using namespace std;
 
// Function will return number of
// characters to be added
int minInsertion(string str)
{
    // To store string length
    int n = str.length();
 
    // To store number of characters
    // occurring odd number of times
    int res = 0;
 
    // To store count of each
    // character
    int count[26] = { 0 };
 
    // To store occurrence of each
    // character
    for (int i = 0; i < n; i++)
        count[str[i] - 'a']++;
 
    // To count characters with odd
    // occurrence
    for (int i = 0; i < 26; i++)
        if (count[i] % 2 == 1)
            res++;
 
    // As one character can be odd return
    // res - 1 but if string is already
    // palindrome return 0
    return (res == 0) ? 0 : res - 1;
}
 
// Driver program
int main()
{
    string str = "geeksforgeeks";
    cout << minInsertion(str);
 
    return 0;
}

Java




// Java program to find minimum number
// of insertions to make a string
// palindrome
public class Palindrome {
 
    // Function will return number of
    // characters to be added
    static int minInsertion(String str)
    {
        // To store string length
        int n = str.length();
 
        // To store number of characters
        // occurring odd number of times
        int res = 0;
 
        // To store count of each
        // character
        int[] count = new int[26];
 
        // To store occurrence of each
        // character
        for (int i = 0; i < n; i++)
            count[str.charAt(i) - 'a']++;
 
        // To count characters with odd
        // occurrence
        for (int i = 0; i < 26; i++) {
            if (count[i] % 2 == 1)
                res++;
        }
 
        // As one character can be odd return
        // res - 1 but if string is already
        // palindrome return 0
        return (res == 0) ? 0 : res - 1;
    }
 
    // Driver program
    public static void main(String[] args)
    {
        String str = "geeksforgeeks";
        System.out.println(minInsertion(str));
    }
}

Python3




# Python3 program to find minimum number
# of insertions to make a string
# palindrome
import math as mt
 
# Function will return number of
# characters to be added
def minInsertion(tr1):
 
    # To store str1ing length
    n = len(str1)
 
    # To store number of characters
    # occurring odd number of times
    res = 0
 
    # To store count of each
    # character
    count = [0 for i in range(26)]
 
    # To store occurrence of each
    # character
    for i in range(n):
        count[ord(str1[i]) - ord('a')] += 1
 
    # To count characters with odd
    # occurrence
    for i in range(26):
        if (count[i] % 2 == 1):
            res += 1
 
    # As one character can be odd return
    # res - 1 but if str1ing is already
    # palindrome return 0
    if (res == 0):
        return 0
    else:
        return res - 1
 
# Driver Code
str1 = "geeksforgeeks"
print(minInsertion(str1))
 
# This code is contributed by
# Mohit kumar 29

C#




// C# program to find minimum number
// of insertions to make a string
// palindrome
using System;
 
public class GFG {
 
    // Function will return number of
    // characters to be added
    static int minInsertion(String str)
    {
         
        // To store string length
        int n = str.Length;
 
        // To store number of characters
        // occurring odd number of times
        int res = 0;
 
        // To store count of each
        // character
        int[] count = new int[26];
 
        // To store occurrence of each
        // character
        for (int i = 0; i < n; i++)
            count[str[i] - 'a']++;
 
        // To count characters with odd
        // occurrence
        for (int i = 0; i < 26; i++) {
            if (count[i] % 2 == 1)
                res++;
        }
 
        // As one character can be odd
        // return res - 1 but if string
        // is already palindrome
        // return 0
        return (res == 0) ? 0 : res - 1;
    }
 
    // Driver program
    public static void Main()
    {
        string str = "geeksforgeeks";
         
        Console.WriteLine(minInsertion(str));
    }
}
 
// This code is contributed by vt_m.

PHP




<?php
// PHP program to find minimum number
// of insertions to make a string
// palindrome
 
// Function will return number of
// characters to be added
function minInsertion($str)
{
    // To store string length
    $n = strlen($str);
 
    // To store number of characters
    // occurring odd number of times
    $res = 0;
 
    // To store count of each
    // character
    $count = array(26);
 
    // To store occurrence of each
    // character
    for ($i = 0; $i < $n; $i++)
        $count[ord($str[$i]) - ord('a')]++;
 
    // To count characters with odd
    // occurrence
    for ($i = 0; $i < 26; $i++)
    {
        if ($count[$i] % 2 == 1)
            $res++;
    }
 
    // As one character can be odd return
    // res - 1 but if string is already
    // palindrome return 0
    return ($res == 0) ? 0 : $res - 1;
}
 
// Driver program
$str = "geeksforgeeks";
echo(minInsertion($str));
 
// This code is contributed
// by Mukul Singh
?>

Javascript




<script>
 
// JavaScript program to find minimum number
// of insertions to make a string
// palindrome
     
    // Function will return number of
    // characters to be added
    function minInsertion(str)
    {
        // To store string length
        let n = str.length;
   
        // To store number of characters
        // occurring odd number of times
        let res = 0;
   
        // To store count of each
        // character
        let count = new Array(26);
        for(let i=0;i<count.length;i++)
        {
            count[i]=0;
        }
   
        // To store occurrence of each
        // character
        for (let i = 0; i < n; i++)
            count[str[i].charCodeAt(0) -
            'a'.charCodeAt(0)]++;
   
        // To count characters with odd
        // occurrence
        for (let i = 0; i < 26; i++) {
            if (count[i] % 2 == 1)
                res++;
        }
   
        // As one character can be odd return
        // res - 1 but if string is already
        // palindrome return 0
        return (res == 0) ? 0 : res - 1;
    }
     
    // Driver program
    let str = "geeksforgeeks";
    document.write(minInsertion(str));
     
 
// This code is contributed by unknown2108
 
</script>

Output:  

2

This article is contributed by nuclode. If you like GeeksforGeeks and would like to contribute, you can also write an article using write.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above.
 

Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready.  To complete your preparation from learning a language to DS Algo and many more,  please refer Complete Interview Preparation Course.

In case you wish to attend live classes with industry experts, please refer DSA Live Classes 




My Personal Notes arrow_drop_up
Recommended Articles
Page :