thank your for the comments. I was so lost looking at people's solutions

1. If not stated, the area by definition is always the positive value, and the sides are undirected, so it's not required to specifically note about absolute area. (Otherwise yeah, the area might be negative in some circumstances, but that's an overkill imho)

2. Probably that was because of some shenanigans with assertions; rn both 3.10 and 3.11 correctly evaluate either float or int values, so it doesn't really matter to specify that either.

Hope I've answered your suggestions, closing this now

approved!

i substantially improved the RNG in Python

Not really an issue, no performance tag, no explicit mention of large arrays. A performant version may be created but I doubt if it is any different than myjinxin's three sum and four sum kata (potentially others ... ->

• simple fun ? a + b + c
• simple fun ? a + b + c + d

One of the best kata I've done!

reminds me the Minion movie

Done

Interesting kata, not that easy.

Great kata of the series to practice with and to learn from, thanks.

More like a math challenge, however nice.

Nice kata.

I saw SADS, but changed it to UNHAPPY instead :P

Pretty funny and challenging kata to practice optimization algorithms with.

Seems unneccessary to mention the test parameters in the description as they both vary by language and have no performance constraints beyond what are provided by the sample tests.

The print garbage has been purged.