You are given a string s consisting of lowercase English letters. You can perform two types of operations on the string: 1. Append a lowercase English letter c to the end of the string s. 2. Delete the last character from the string s. You need to convert the strings to a palindrome by performing a series of operations described above. Return the minimum number of operations needed. If the string s is already a palindrome, return O.

You are given a string s consisting of lowercase English letters. You can perform two types of operations on the string: 1. Append a lowercase English letter c to the end of the string s. 2. Delete the last character from the string s. You need to convert the strings to a palindrome by performing a series of operations described above. Return the minimum number of operations needed. If the string s is already a palindrome, return O.