Problem

Description

Given a string of words, you need to find the highest scoring word.
Each letter of a word scores points according to its position in the alphabet: a = 1, b = 2, c = 3 etc.

You need to return the highest scoring word as a string.
If two words score the same, return the word that appears earliest in the original string.
All letters will be lowercase and all inputs will be valid.

Test Cases

For example, the score of `abad` is `8` (1 + 2 + 1 + 4).

Solution

My Solution

def high(x):
    words = {}
    for i in x.split():
        words[i] = sum([ord(c)-96 for c in i])
    return max(words, key=words.get)
    

Other Solutions

Learning Experiences