You will be given two strings `a` and `b` consisting of lower case letters, but `a` will have at most one asterix character. The asterix (if any) can be replaced with an arbitrary sequence (possibly empty) of lowercase letters. No other character of string `a` can be replaced. If it is possible to replace the asterix in `a` to obtain string `b`, then string `b` matches the pattern. 
If the string matches, return `true` else `false`. 
```
For example:
solve("code*s","codewars") = true, because we can replace the asterix(*) with "war" to match the second string. 
solve("codewar*s","codewars") = true, because we can replace the asterix(*) with "" to match the second string. 
solve("codewars","codewars") = true, because the strings already match.
solve("a","b") = false
```
More examples in test cases. 
Good luck!
def solve(a,b):
    s = a.find("*")
    if s == -1:
        return a == b
    else:
        a = list(a)
        b = list(b)
        del b[s:s+1+len(b)-len(a)]
        a.remove("*")
        return a == b
def solve(a,b):
    s = a.find("*")
    if s == -1:
        return a == b
    else:
        a = list(a)
        b = list(b)
        del b[s:s+1+len(b)-len(a)]
        a.remove("*")
        return a == b