dang fr? can you say which 6 kata were easy? i can complete 8s easily and 7s kinda, but 6s are really hard for me

Your function/method checks whether the input string is all lowercase while this Kata asks you to check whether the string is all uppercase.

char? is independent on Tuple. The ? makes the char nullable i.e. you can assign null to it which you can't do with a normal char (see. e.g. this).

Regards, suic

Have you specified the types in the returned Tuple?

return new Tuple<char?, int>(mostRepeatedChar, maxConsecutiveCountInt);

You're welcome, I've only played the original SNES version.

hash is never null but it can be an empty Dictionary, try to fix that. The problem is in your code, not the kata.

It works fine in C# afaik, what's the issue you're talking about?

Here it goes:
https://github.com/Codewars/codewars.com/wiki/Tutorial:-How-to-translate-a-kata

Well, you're not the first one missing that part. :-)

Good luck!

I'll remove the issue tag for now.

The restriction is that the characters in part1 and part2 are in the same order as in s.

"codewars" - "r" before "s", "wasr" - "r" after "s".

The characters in between (as you can see in the examples) may be other parentheses too. You have to account for them too.

That only tests the first and last char, what happens with the inner ones?
And the right label is Question for this kind of post.

I think the "returning to the original point given a certain amount of time" gives that away, you shouldn't feel flustrated because it took you more time than you wanted to figure out how to represent that, we are here to learn and abstraction is part of the learning process.

The exercise by itself is very reasonable, I hope I can eventually pass the "expected value" test so I can check it as finished.