Well make an array of all the destinations, loop through the routes, and make matches i[0] for the i's in the destination array.

Well, can do true, instructions are kind of vague in the false case

Please use spoiler flag next time.

You're trying to access non-exist keys, check for spaces.

see the first 100 factorials and check the similarities . answer will come

you could try checking if the word is punctuation and only adding the "ay" if != "?" or != "!".

Try a math approach.

Well mine works for the tests, but times out whenever I try to Attempt. Don't know how else to do it with out using a for loop

Haskell translation
Happy to change anything you feel should be different, nitpick all you want.

edit: oops. I missed corrupting the bits. so uh yeah. that needs to happen.. tomorrow
edit2: tomorrow became "after tea" all better now.

that is probably because your code doesn't work for names which have two words like 'Donald Trump'. you need to figure out a way you can ignore the space('') between the words.
hope this helps. :)

Well all tests pass, but exit code says this

Traceback (most recent call last):
File "main.py", line 49, in
test.assert_equals(sexy_name('DONALD TRUMP'), "THE ULTIMATE SEXIEST")
File "/home/codewarrior/solution.py", line 10, in sexy_name
score =score+ SCORES[i]
KeyError: ' '

If this issue is reproducible still, please raise a new one.

Code anywhere else looking good has no bearing on CodeWars at all; there is no need to mention that. What would have been useful to know is if the error occurred with the Example tests or the Submit tests.

Closing.

You have to extract indices from input data, then use the given built-in arrays to output the demanded string.