The Syntactic Shield

The Perfect Pairing

In programming, ensuring that every opening bracket has a matching closing bracket is critical. Compilers use a Stack to check this: every time they see an opening bracket, they "remember" it; when they see a closing one, they "match" it with the most recent opener.

The Assignment

Your mission is to build a syntactic validator. Your function receives a string s containing only brackets.

1. Create an empty stack to track opening brackets: (, [, {.
2. Iterate through each character in the string:
   • If it is an opening bracket, push it onto the stack.
   • If it is a closing bracket, pop from the stack and check if the types match (e.g., ( matches )).
   • If they don't match, or the stack is empty when you need to pop, print false and exit.
3. After the loop, if the stack is completely empty, print true. Otherwise, print false.