Great kata, the decrypt function definitely made me think!

I understand now, thanks for your patience.

I didn't want to believe $O(nm)$ work was necessary to solve this kata so I tried every other possibility first, and when one of my wrong solution passed the submission tests, I thought I understood what the kata was really asking for, thus the two incorrectly pointed out issues.

There is one monster - at a time.

"To calculate the damage a sword takes from slaying a monster", to me, clearly says you do this for every monster, but one at a time, if there are multiple monsters.

It can be rewritten if you have trouble reading that into it, but I'd suggest you propose a specific text then, not just say "reword it".

I was referring to the "Fire Scimitar" and "Dragon" example, but I think the first paragraph could also be reworded for the same reason - it mentions damage calculation as if there was only 1 monster.

First paragraph second half?

I read the description 5+ times and still can't understand how damage is calculated. The example would be clearer if it contained more than 1 sword and monster.

• all random arrays of monsters are empty
• the task doesn't really make sense (the way the swords are taking damages: not logical at all in the given context) => it's very/too much artificial

forget that.

actually...

a wrong algo can pass all the tests (not even using the correct function)

What's the point of the monsters array?

Your kata is a combination of these 2 or more which make it a duplicate nontheless:

1 && 2

Note to author: please don't resolve this issue!

Understood, closing this issue so I can edit description.

Added tie-breaker condition. I disagree on the example needing to use an entire array. It is meant only to show the logic of how to compute damage, not to work the whole problem.

Your kata is a combination of these 2 or more which make it a duplicate nontheless:

1 && 2

• The description is not clear on how should we compute the least sword without examples on using the entire array instead of using a specific pair

• we first need to find the total of the ASCII values of the name of the sword (excluding the space): But you got an extra 32 in the example

• Tie-breaker situation is not specified, should we take the first one or the last occurrence of such swords???