Good solution! I guessed that using a stack it is possible to solve this problem. But apparently I was in a hurry and didn't figure out how exactly.
But now I figured out that you can only add opening brackets to the stack and remove them from the stack if we find them closing.

Nice solution! And good for understanding.

Yes, this solution is quite compact. But a huge disadvantage is that it is unreadable.

Thanks, brother @chubbypanther.
You really helped me. Because I did not know this condition.

Hmmm...
Pretty graceful.
My solution is far from this.

Oh good Kata. It's nice to practice your logic. But I did Kata, of course, for a long time 😂, and not effectively.

I think that my solution it seems on your. But i used arrays. And i think that this is more usefull (with lists).
I don't know how good LINQ solutions are in professional projects.

Ooh, its so cool. I'll must to learn more about LINQ.

This is the most effective solution. Because only one array is used here to iterate over. This is O (n) as opposed to O (4n) where LINQ is used.
But I also think that it was possible to make the code a little more readable using a switch case.

O.o
One line of code vs 15 of my code)