Skip to content

Latest commit

 

History

History

Minimum Insertions to Form a Palindrome

Folders and files

NameName
Last commit message
Last commit date

parent directory

..
code_1.cpp
code_1.cpp
 
 
code_2.cpp
code_2.cpp
 
 
readMe.md
readMe.md
 
 

readMe.md

Given a string, find the minimum number of characters to be inserted to convert it to palindrome.

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
abcde: Number of insertions required is 4 i.e. edcbabcde