Valid Parentheses Problem Statement

Given a string 'STR' consisting solely of the characters “{”, “}”, “(”, “)”, “[” and “]”, determine if 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 that you need to check for balanced parentheses.

Output:

For each test case, print a single line stating whether the string is balanced or not, with each result on a new line.

Example:

Input:

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

Output:

"Balanced" "Not Balanced"

Constraints:

1

Question

Valid Parentheses Problem Statement

Given a string 'STR' consisting solely of the characters “{”, “}”, “(”, “)”, “[” and “]”, determine if 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 that you need to check for balanced parentheses.

Output:

For each test case, print a single line stating whether the string is balanced or not, with each result on a new line.

Example:

Input:

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

Output:

"Balanced"
"Not Balanced"

Constraints:

1 <= T <= 10
1 <= N <= 10⁵

Note:

No need to print anything explicitly. Just implement the functionality to determine if the strings are balanced.

Accepted Answer

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

Use a stack data structure to check for balanced parentheses.
Iterate through the string and push opening parentheses onto the stack.
If a closing parenthesis is encountered, check if it matches the top of the stack.
If it matches, pop the top element from the stack.
If the stack is empty at the end, the parentheses are balanced.
If the stack is not empty or a closing parenthesis doesn't match, the parentheses are not balanced.