Stupid solution of print longest sequence of character from string s

longest_sequence.py

s = 'azcbobobegghakl'
result = ''
tmp = ''

for i in range(len(s)-1):
    if s[i] <= s[i+1]:
        tmp += s[i]
        if i == len(s) - 2:
            tmp += s[i+1]
            if len(tmp) > len(result):
                result = tmp
    else:
        tmp += s[i]
        if len(tmp) > len(result):
            result = tmp
        tmp = ''

print("Longest substring in alphabetical order is: " + result)
# Longest substring in alphabetical order is: beggh