If the change was done to example tests, then this does not invalidate any solutions because solutions are tested only against the submission tests, and not example tests.

Quite mathematical kata on some little algorithm optimization, well done.

As said in description:

A team can know the bonus amount of its adjacent team, if the
score of the adjacent team is lower than itself.

This means the first team (team who scored 30) will know the bonus amount of the second team (team who scored 20), the second team will know the amount of bonus from the third team (team who scored 10). Also said in description that:

If a team finds that its bonus is no higher than the adjacent team whose
score is lower than itself, the team will not be satisfied

First we know that the third team knew none of the other teams' score, therefore they get the lowest of 1 bonus. Secondly, the second team knew the score of third team (which means second team have a higher amount of score), therefore they needed a bonus amount higher than 1, which is 2. We can also use the same logic to get the amount of bonus for the first team, they needed a bonus higher than 2, which is 3. Then we add all the bonuses together to get:

1+2+3=6k, so the answer is 6 for minimum bonus. Sorry if my explaination isn't clear enough :)

glad you enjoyed it!

Thanks for the comment ~ inspired to create an anniversary celebration themed kata, I strove to create a simple real-world task that could be easily visualized.

great kata!

Thank you very much,that was very helpful.Im beginner and i wouldnt consider this approach.

Your solution is too slow, especially for more difficult/larger inputs. The computational complexity of some problems grows rapidly with input size and sometimes trivial, naïve solutions pass for small inputs, but are not sufficiently performant for more challenging scenarios. You probably need to think of a better approach: some optimizations might help, but also might not. In the latter case, you probably need to think of a better algorithm.

Tl;dr, you need a faster code. Most passed solutions can solve this kata within 1000ms.

Troubleshooting Your Solution

(Hint: try to look for pattern instead of brute-forcing)

Resolved in this fork

• Description should be language-agnostic

• Probably better to use KaTeX for the mathematical part of the code

Thanks @cod3abuser! But technically it's not a good solution hahaha

Thanks for the nice kata!