Longest Seq

Longest Sequence

def findSeq(str):
    # A list to store the words.
    seq = []
    # Create words from the given string and
    # store in seq.
    word = str[0]
    for i in range(len(str)-1):
        current = ord(str[i])
        next = ord(str[i+1])
        if current <= next:
            word += str[i+1]
        else:
            seq.append(word)
            word = str[i+1]
    seq.append(word)

    # Find the longest word and return it.
    longest = seq[0]
    for i in range(len(seq)-1):
        if len(seq[i]) < len(seq[i+1]):
            longest = seq[i+1]

    return longest