the EBNF sucks can I use C's grammar for this ? for example
identifier ::= letter | '' { identifier-char }
identifier-char ::= '' | letter | digit

would make '__' a valid variable name

depends on the language

you don't need integer_sequence at all, also, lambdas might be useful for this...

hard as hell if you don't know templates that well, like me

remove duplicates

if I find '\n' in the input text that becomes a new line in the cloud? does the input include \t's? if so how many spaces is it?

I had to lookup an algorithm for this, a mind bender for sure

In C++ one of the cases says that "JH 9H TH KH QH" should beat "JH AH TH KH QH", which is incorrect I think because opponent's hand has an ace as high card.

Need to add random cases

How do I add my own translation, I don't see the option in the dropdown menu

any clue on how to improve performance? I time out at the last test

in c++, how do I do it without the definition of RegExp or the helper functions?

Language: C
Kata crashes with a "free(): invalid pointer" message in stderr. I tried freeing the pointer myself locally and tested it with valgrind just to see if all went all right and no issues.

Fun kata, the task is simpler than you think