This would solve issues with empties created from splits on pesky spaces, but doesn't handle the scenario where the string ONLY contains a space (which isn't eleminated as a possibility in the brief), which would result in Min failing due to no elements in the sequence.
Assert.AreEqual(0, Kata.FindShort(" "));
This solution is clean and simple, but doesn't take into account if the string, while not empty, contains any number of whitespace that aren't perfectly placed in the string (i.e. whitespace in the beginning or end or double-spaced).
Assert.AreEqual(1, Kata.FindShort(" a"));
Assert.AreEqual(1, Kata.FindShort("a "));
Assert.AreEqual(2, Kata.FindShort("an amp"));
We must split using StringSplitOptions.RemoveEmptyEntries in case of doublespaces.
Within the limit, there's only one possible solution. Allow room for creativity, relax the limit.
Well, this kata is more like a codepuzzle, so algorithmwise not really compareable to other katas... so the ranking of these katas are different.
It wouldnt represent the skillset of a dev, because its a solution you could find somewhere in the internet, you don't really have to solve it, you just have to find out how :)
Agreed. Gave it to some of my junior devs. They couldn't solve. Seems like a lot of 7 & 8 kyu challenges are incorrectly categorised like this
even with 8
Yes it is solvable with 9.
Is this for sure solvable with 9 character code, i got it down to 10 and can't think of a shorter one?
I dont really understand what do u want, can someone explain?
Srlsly its 7kyu lvl?...-.-
Why check 100 random letters? Why not just check all lowercase and all uppercase letters?