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

Check if given strings containing parentheses are balanced or not.

Use a stack to keep track of opening parentheses
Iterate through the string and push opening parentheses onto the stack
When a closing parentheses is encountered, pop from the stack and check if it matches the corresponding opening parentheses
If stack is empty at the end and all parentheses are matched, the string is balanced

Valid Parentheses Problem Statement

Input:

Output:

Example:

Input:

Output:

Constraints:

Note:

LTIMindtree Software Developer interview questions & answers

Popular interview questions of Software Developer