You will be given a string and you task is to check if it is possible to convert that string into a palindrome by removing a single character. If the string is already a palindrome, return `"OK"`. If it is not, and we can convert it to a palindrome by removing one character, then return `"remove one"`, otherwise return `"not possible"`. The order of the characters should not be changed.
For example:
```Haskell
solve("abba") = "OK". -- This is a palindrome
solve("abbaa") = "remove one". -- remove the 'a' at the extreme right. 
solve("abbaab") = "not possible". 
```
More examples in the test cases. 
Good luck!
If you like this Kata, please try [Single Character Palindromes II](https://www.codewars.com/kata/5a66ea69e6be38219f000110)
def get_pal(s):
    if len(s) == 1: return 0
    if len(s) == 2 and s[0] == s[1]: return 0
    elif len(s) == 2 and s[0] != s[1]: return 1
    return 1 + min(get_pal(s[1:]), get_pal(s[:-1])) if s[0] != s[-1] else get_pal(s[1:-1])
        
def solve(s):
    ans = get_pal(s)
    return "OK" if ans == 0 else "remove one" if ans == 1 else "not possible"
def get_pal(s):
    if len(s) == 1: return 0
    if len(s) == 2 and s[0] == s[1]: return 0
    elif len(s) == 2 and s[0] != s[1]: return 1
    return 1 + min(get_pal(s[1:]), get_pal(s[:-1])) if s[0] != s[-1] else get_pal(s[1:-1])
        
def solve(s):
    ans = get_pal(s)
    return "OK" if ans == 0 else "remove one" if ans == 1 else "not possible"