Approved

no need to check if numbers are repeated, just check for membership in the subset

No problem. Fork: https://www.codewars.com/kumite/6277e3082c2881b018504456?sel=62896cb9b7d077412ba87e0e

Merge conflict. LC changed the description. Sorry. :/

Approved

fixed tests are easy to bypass

Hardcoding fixed tests is an obvious cheat, and biasing random generators correctly is hard. Having fixed tests for edge cases is perfectly fine IMO. A determined cheater will cheat anyway, and should just be nuked from orbit.

I included such a fixed test in COBOL. Though, I'm not sure this is sufficiently common error to be considered a true issue for the kata, and in all cases fixed tests are easy to bypass.

COBOL translation (author is inactive).

I had a working Python solution which only matched when there were additional characters present apart from the BINGO letters.

what do you mean by exactly ?

Sloppy code, or optimised code?

Regardless, I like seeing the different solutions that people come up with, so I can learn new ways to do things That is why I wrote this suggestion in the 1st place - I felt the choice of enum values was unnecessarily limiting the kind of solutions possible.

Java, Python, JS, maybe others: There is no test where the BINGO numbers are given exactly. A solution which fails this test can still pass.

I got it. Thank you so much!

Oh ok nevermind what I said then, I thought it had some special meaning. C does have enumerated types (enums), and it would be perfectly reasonable to have enum outcome { LOSE = false, WIN = true}; here

I don't know TS either ( I know JS, but it doesn't have the enum type ).

But I think they're effectively the same ( up to implementation details ).