Hi
Thanks for your attention.
It is really a vain part of code whereas C# handle it.
Have a nice day.

Why bother with if > 255 check while you use byte anyway?

The variables could have been name more clearly, but otherwise it's nice and simple solution!

It's too bad this hasn't gotten more Best Practice votes. I think this is the cleanest and simplest answer I've seen yet. Good job!

Hi dear Kata Writter.

Kata Test has problem.

Just look at below sample:

str = "Lorem ipsum dolor sit amet, consectetur a...";
len = 15;

so it really expected:

Lorem     ipsum\n
dolor       sit\n
amet,\n
consectetur\n
a...

but you expected it as:

Lorem     ipsum\n
dolor\n
sit\n
amet,\n
consectetur\n
a...

I'm confused how and why third and fourth words "dolor" & "sit" which their length is less than 15 put in two separate lines????!!!

I have a problem with Mono compiler(c#) when try to retrive similar word from that IEnumerable, too:

words.ToArray()[ indexOfSimilarWord ]

when indexOfSimilarWord is retrive from other Array by same size as IEnumerable

when I convert IEnumerable to string Array there isnt any problem and all test is passed

What a defalcation!!!
despite of kata, just look at bank:
it is obvious that if three people buy three tickets finally should be 75 dollars in bank...
but in this algorithm after a [25 25 50] sequence we have only 50 dollars in bank, !!!
As what happened in algorithm: 25 + 25 - (50-25) + 25 = 50 !!!

Return True if every number in first array squared is in the second array else False.

66^2 is 4356.
4356 is not in the second array. Therefore, it is False.

Description says:

... with the same multiplicities

Do you think the multiplicities are the same in your example?

This Kata has an error in problem definition :
it suppose that two arrays should have same length...
but if we have
a=[2,-2]
and
b=[4]
it is true and doesnt violate any conditions in problem definition even though they are not same by Length...