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 if a given string consisting of parentheses is balanced or not.

Iterate through each character in the string and use a stack to keep track of opening parentheses
If an opening parenthesis is encountered, push it onto the stack
If a closing parenthesis is encountered, check if it matches the top of the stack. If it does, pop the stack, else return 'Not Balanced'
At the end, if the stack is empty, return 'Balanced', else return 'Not Balanced'

Valid Parentheses Problem Statement

Input:

Output:

Example:

Input:

Output:

Constraints:

Note:

Freshworks Graduate Trainee interview questions & answers

Popular interview questions of Graduate Trainee