covertPalindromeCount.py

s1 = input()
s2 = input()

def checkPalindrome(s):
    return s == s[::-1]
    
def isSubString(src, s):
    for i in range(len(src)):
        for j in range(len(src)):
            if src[i:j] == s:
                return True
    return False

def toPalindrome(s):
    count = 0
    if checkPalindrome(s): return s
    
    if len(s) % 2 == 0:
        arr = [i for i in s]
        k = len(s)//2 
        for i in range(len(s)//2, 0, -1):
            arr[k] = s[i-1]
            k += 1
            output = ""
            count += 1
            for i in arr:
                output += i
            if checkPalindrome(output): return [output, count]
            
        output = ""
        for i in arr:
            output += i
    
        return [output, count]
print(toPalindrome(s1)[1])
print(isSubString(toPalindrome(s1)[0], s2))