Balanced Parentheses Check

Given a string STR consisting solely of the characters '{', '}', '(', ')', '[', and ']', determine whether the parentheses are balanced.

Input:

The first line contains an integer 'T' representing the number of test cases. Each of the following T lines contains a string representing a test case.

Output:

For each test case, output 'YES' if the expression is balanced and 'NO' otherwise. Each result should be printed on a new line.

Example:

Input:

3
{}[()]
{[}]
({[()]})

Output:

YES
NO
YES

Constraints:

1

Question

Balanced Parentheses Check

Given a string STR consisting solely of the characters '{', '}', '(', ')', '[', and ']', determine whether the parentheses are balanced.

Input:

The first line contains an integer 'T' representing the number of test cases. Each of the following T lines contains a string representing a test case.

Output:

For each test case, output 'YES' if the expression is balanced and 'NO' otherwise. Each result should be printed on a new line.

Example:

Input:

3
{}[()]
{[}]
({[()]})

Output:

YES
NO
YES

Constraints:

1 <= T <= 10
1 <= N <= 10^5
Where N is the length of the input string or expression.

Note: You don't need to print anything yourself; just implement the function to solve the problem.

Accepted Answer

Implement a function to check if parentheses in a string are balanced.

Use a stack to keep track of opening parentheses and pop when a closing parenthesis is encountered.
If the stack is empty when a closing parenthesis is encountered or if there are unmatched parentheses at the end, return 'NO'.
Ensure that all opening parentheses have a corresponding closing parenthesis in the correct order.
Return 'YES' if all parentheses are balanced.
Example: Input: {[()]}, Output: YES

Balanced Parentheses Check

Input:

Output:

Example:

Constraints:

Snapdeal Software Engineer interview questions & answers

Popular interview questions of Software Engineer