Thanks! I think I almost understand it now... lol... :-P

This one is so interesting. I can't figure out how it works. Can somebody please explain it to me?

print statement indeed

1. If the players would follow that description, no cheating would happen at all.
2. Yes (including mine). That's the point.

But it's your kata and I accept your decision. Thank your for creating it.

I think no need to test negative numbers.
two reasons:
1, not fit the description. it said the initial values are zero, and then increase some numbers on the table.
2, if I add some testcases with negative, most of the exist solutions may be failed.
Thanks for your suggestion, but I don't want to add negative In this kata ;-)

If the given number does not conform to the rules ;-)

How can you tell if the guy is "cheating"?

foreach (int i in peopleInLine)
{
Console.WriteLine(i);
}

print people

will give you the info in the log.

(T..T) same issue here...there was a test result should return "YES" but my result was "NO"...

Hey there!

I've been getting failure messages. But when I compare my answer with the "expected answer", it matches up.

Any suggestions?

You have to track the bills, not just dollar amounts. Your's would work if they only had $25 bills. Instead he specifies they either have $25 bills, $50 bills or $100 bills. No other denominations.

C# works as does Java

You probably read the question wrong as I initially did. There are only 25, 50 and 100 dollar bills (no increments or sub-types). It took 1 for-loop and several conditionals to solve it. No other data structures, recursion or functions needed.

If he made you track different payment amounts (given as nested arrays), evaluate whether or not the value was enough and then see if he could successfully get through the line (with multiple coin and dollar amounts), then it would definitely be a 5 kyu problem...