I dont think so, given that there has to be a missing letter at index 1 or length -1. In that case it is fine and works. In general it could be better code practice to avoid index errors.

Wrote this the exact same way. Beautiful code!

Off-by-one error. The condition in the loop needs to be i < letters.length - 1.

Thanks!

nicely done

nice, cleanest solution i've seen.

Doesn't seem so DRY

bro i solved it simiarly) nice job friend

this solution deserves more upvotes for best practices
beautiful code

well explained - thank you!

It looks like this does the entire 'sumPoints' calculation twice each time you do a compare. Wouldn't it make an appreciable difference to calculate all the scores once and then use those values to sort?

you saved me!

You should never put any information which might give away the kata solution in the comments (without checking the "mark as having spoiler content" box) as they're visible to every one.