Convert string to palindrome string with minimum insertions

Question

In order to find the minimal number of insertions required to convert a given string(s) to palindrome I find the longest common subsequence of the string(lcs_string) and its

Answer 1

The solution looks to be a dynamic programming solution.

You may be able to find your answer in the following post: How can I compute the number of characters required to turn a string into a palindrome?