every day we wake up to learn

I'm aware that it requires overloading, default function arguments, and maybe even function or class templates (though I currently still hope templates should not be necessary). As for differing return types (of overloaded functions): In line with @hobovsky, I think/hope std::variant would not be needed, overloading should suffice.

I personally wouldn't mind if these obstacles bumped the difficulty to 4 kyu or above, but I'm not sure how that would be handled here on Codewars properly, maybe with a fork?

That's true. I remembered the Kata much differently than what it is, and the fixed tests are rather a breeze. All the problems I expected actually show up when trying to adapt the random tests. If I find a clean way to implement the random tests, I'll publish the translation

I am not sure about this. I think that the goal of the kata could be achieved with a simple overloading, couldnt it?

As a statically typed language, this task is nearly impossible to adapt to C++ with the same level of difficulty. You have the issue of inconsistent argument signatures and return types, which will require templates, function overloading, std::variant, etc. Even then, it won't behave exactly like it does in dynamic languages. The combination of all of this definitely bumps it up to 4kyu and will make for a miserable user experience at 5kyu imo. I will give translating this a shot as a fun exercise, but I can't make promises that anything actually user-viable will come out of this since I'm skeptical

Challenging filtering the right time, awesome kata.

C++ translation wanted.

I really, really enjoyed this kata, it's been a fun exercise in functional programming for me. Thanks a lot!

The 5 kyu rating is ridiculous; it's clearly an 8 kyu, absolute beginner level, no more.

Easy points, though. ;-)

Could someone take a look at this? The kata author is no longer active.

See this paragraph: https://docs.codewars.com/training/troubleshooting/#timeout

And maybe some other paragraphs too, for example "how to report issues" one.

Hello, I'm trying to do this in python and my code can complete the basic tests in around 0.2ms, and in the attempt it completes the unique letters in around 1.6ms and the duplicate letters in around 1.0ms, but when it gets to the random tests sometimes it completes none and then other times it can do 31 of them, but i keep getting timed out and at the top it simply says: " Failed: ?". I haven't been using code wars for very long but i was wondering if the code really just needs to be more efficient or if there's a weird error occurring. Thank you.

are you nigerian lmaooo

make sure to return the values not just print them

Very nice as an exercise also because until today I didn't even know about the existence of unordered_maps, so I really liked it