Parenthesis/Brackets Matching using Stack algorithm

Question

For example if the parenthesis/brackets is matching in the following:

({})
(()){}()
()

and so on but if the parenthesis/brackets is not mat

Answer 1

The algorithm:

1. scan the string,pushing to a stack for every '(' found in the string
2. if char ')' scanned, pop one '(' from the stack

Now, parentheses are balanced for two conditions:

• '(' can be popped from the stack for every ')' found in the string, and
• stack is empty at the end (when the entire string is processed)