Fork this repo and git clone
your forked repo to your computer. Once happy with your solution, git push
and submit a pull request.
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.
To test your solution, run npm install
in the root directory and then run npm test
to run the automated tests.
Push your changes to your forked repo and submit a pull request to this repo.