# Description:
 Find the longest successive exclamation marks and question marks combination in the string. A successive exclamation marks and question marks combination must contains two part: a substring of "!" and a substring "?", they are adjacent. 
 If more than one result are found, return the one which at left side; If no such a combination found, return `""`.
# Examples
```
find("!!") === ""
find("!??") === "!??"
find("!?!!") === "?!!"
find("!!???!????") === "!!???"
find("!!???!?????") === "!?????"
find("!????!!!?") === "????!!!" 
find("!?!!??!!!?") === "??!!!"
```
# Note
Please don't post issue about difficulty or duplicate. Because:
>[That's unfair on the kata creator. This is a valid kata and introduces new people to javascript some regex or loops, depending on how they tackle this problem.  --matt c](https://www.codewars.com/kata/remove-exclamation-marks/discuss#57fabb625c9910c73000024e)
def find(s):
    if s == '' or '!' not in s or '?' not in s:
        return ''
    s += ' '
    counts = []
    curr = s[0]
    count = 0
    for i in s:
        if i == curr:
            count += 1
        else:
            counts.append(count)
            count = 1
            curr = i
    n = []
    for i in range(len(counts)-1):
        n.append(counts[i]+counts[i+1])
    x = n.index(max(n))
    
    a = sum(counts[:x])
    return s[a:a+counts[x]+counts[x+1]]
def find(s):
    if s == '' or '!' not in s or '?' not in s:
        return ''
    s += ' '
    counts = []
    curr = s[0]
    count = 0
    for i in s:
        if i == curr:
            count += 1
        else:
            counts.append(count)
            count = 1
            curr = i
    n = []
    for i in range(len(counts)-1):
        n.append(counts[i]+counts[i+1])
    x = n.index(max(n))
    
    a = sum(counts[:x])
    return s[a:a+counts[x]+counts[x+1]]