There's, clearly, a mistake in the example. Considering eligible numbers (divisible by 3 or 7) must not exceed N (30 in your example), 33, 35, 42 should be excluded. Furthermore, because of that the actual sum of #1, #2, #3 must be greater, which is most obvious for #3.

This one will drop off words beyond 3-rd (e.g. double-barrelled surname divided by space instead of hyphen), so 3 extra dots seems to be a reasonable cost.

...for some reason, I thought n is of type number

no worries, no kata, no ssue

...

...

.....

.......

The one with the least sum of indexes.

as being said, I offer the puzzle, you choose you play or cheat

I don't care if you find it more enternaining to spoof succesfull test passing rather than solving the task itself. If you throw a bit of your creativity into anti-cheat contribution, I'll appreciate that, though.

I guess, it makes sense to state explicitly that all spaces must be removed, not only those between words, as certian methods may ignore leading/trailing spaces, while camelcasing words. So, 'All words must have their first letter capitalized without spaces' may be turned into more comprehensive 'All words must have their first letter capitalized, all spaces must be removed'.

Thanks. Now it looks absolutely bulletproof :)

need some while to isolate private part with closures...