Problem of the Day : Form a palindrome

Given a string, find the minimum number of characters to be inserted to convert it to palindrome.
For Example:
ab: Number of insertions required is 1. bab or aba
aa: Number of insertions required is 0. aa
abcd: Number of insertions required is 3. dcbabcd
Example 1:
Input:
abcd
Output:
3
Explanation:
Here we can append 3 characters in the
beginning,and the resultant string will
be a palindrome ("dcbabcd").
Example 2:
Input:
aba
Output:
0
Explanation:
Given string is already a pallindrome hence
no insertions are required.
Your Task:
You don't need to read input or print anything. Your task is to complete the function findMinInsertions() which takes string S as input parameters and returns minimimum numser of insertions required.
Expected Time Complexity: O(|S|2)
Expected Auxiliary Space: O(|S|2)

[@learntogether7741]

A video edit is currently under process, apologising for some wrong content from 4.07 to 7.17

[@learntogether7741]

Foa abda, let our s1 = abda reverse s1 = adba here when we look we can see our longest common subsequence is ada which is of length 3 So the minimum insertion will be 4 - 3 = 1. We can either change d to b to make the string abba or change b to d to make adda. @shubham tripathy. Thank you