In this Kata, you will check if it is possible to convert a string to a palindrome by changing one character. 
For instance:
```Haskell
solve ("abbx") = True, because we can convert 'x' to 'a' and get a palindrome. 
solve ("abba") = False, because we cannot get a palindrome by changing any character. 
solve ("abcba") = True. We can change the middle character. 
solve ("aa") = False 
solve ("ab") = True
```
Good luck!
Please also try [Single Character Palindromes](https://www.codewars.com/kata/5a2c22271f7f709eaa0005d3)
def solve(s):
    print(s)
    
    if s == s[::-1] and len(s) % 2 == 0: return False
    
    left, right = [], []
    l = list(s)
    counter = 0
    
    while l:
        e = l.pop(0)
        if l:
            e2 = l.pop()
            if e != e2 and counter == 0:
                e2 = e
                counter += 1
            right.insert(0, e2)
        else:
            e = left[-1]
        left.append(e)
        
    s = ''.join(left + right)
    
    return s == s[::-1]
        
        

def solve(s):
    print(s)
    
    if s == s[::-1] and len(s) % 2 == 0: return False
    
    left, right = [], []
    l = list(s)
    counter = 0
    
    while l:
        e = l.pop(0)
        if l:
            e2 = l.pop()
            if e != e2 and counter == 0:
                e2 = e
                counter += 1
            right.insert(0, e2)
        else:
            e = left[-1]
        left.append(e)
        
    s = ''.join(left + right)
    
    return s == s[::-1]
        
        
