Valid Parenthesis Problem Statement

Given a string str composed 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. For each test case, there is a single line containing a string as described.

Output:

For each test case, output a single line indicating if the string is balanced or not.

Example:

Input:

T = 2 STR = "{[()]}" STR = "{[(])}"

Output:

YES NO

Explanation:

The first string is balanced whereas the second is not.

Constraints:

1

Question

Valid Parenthesis Problem Statement

Given a string str composed 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. For each test case, there is a single line containing a string as described.

Output:

For each test case, output a single line indicating if the string is balanced or not.

Example:

Input:

T = 2
STR = "{[()]}"
STR = "{[(])}"

Output:

YES
NO

Explanation:

The first string is balanced whereas the second is not.

Constraints:

1 <= T <= 10
1 <= N <= 10^5
Where N is the length of the input string.
Time Limit: 1 sec

Note:

You are not required to print anything explicitly. Just implement the function.

Accepted Answer

The task is to determine if the given string of parentheses is balanced or not.

Use a stack to keep track of opening parentheses
When encountering a closing parenthesis, check if it matches the top of the stack
If the stack is empty or the parentheses do not match, the string is not balanced
Return 'YES' if all parentheses are balanced, 'NO' otherwise

Valid Parenthesis Problem Statement

Input:

Output:

Example:

Input:

Output:

Explanation:

Constraints:

Note:

Infosys System Engineer interview questions & answers

Popular interview questions of System Engineer

Top HR questions asked in Infosys System Engineer