This code seems to work, but I'm trying to comprehend how it checks the 9 regions.

OP solved it, closing

yeah you are missing a couple of cases. That would totally work if there were not test cases containing only characters. try changing the test from "(()))" to a wingle word like "hello". I had to do a little workaround for that to work

Your solution fails on cases where parens not sorted in the usual way.

Ex: [')()()()(']
['())(']

So it's not enough to find equal amount of parens.

determines if the order of the parentheses is valid

Only counting them is not enough.

Ah, I get it. I will do that. Thank you.

Run your solution in your IDE two times, test1 and test2 one after another in one run.

No, I just solved the kata in C# and it worked for me as expected, so I am closing this as not a kata issue. Try to find error in your solution, and if you can't find any, post your code here.

are you testing an older version of your solution and have a newer one on VS?

I'm using C#

When I do this on Visual Studio it works.

But when I run the test it says I'm getting test2 wrong.

Here's the output:
Test2
Test Failed
Expected string length 56 but was 129. Strings differ at index 13.
Expected: "Burger Fries Fries Chicken Pizza Sandwich Milkshake Coke"
But was: "Burger Fries Chicken Pizza Pizza Pizza Sandwich Milkshake Mil..."

But on Visual Studio I'm getting: "Burger Fries Fries Chicken Pizza Sandwich Milkshake Coke" which looks correct to me.

Anyone else having this problem on C#?