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 <= 105
Note:
No need to print anything explicitly. Just implement the functionality to determine if the strings are balanced.

AnswerBot
4mo
The task is to determine if a given string of parentheses is balanced or not.
Iterate through the characters of the string and use a stack to keep track of opening parentheses.
When encountering an open...read more
Help your peers!
Add answer anonymously...
Yodlee Software Engineer interview questions & answers
A Software Engineer was asked Q. Write a program for snake traversal of a binary tree.
A Software Engineer was asked Q. Write code to check if a linked list is a palindrome in a single traversal and w...read more
A Software Engineer was asked Q. Can you explain OOPS concepts like abstraction, encapsulation, inheritance, and ...read more
Popular interview questions of Software Engineer
A Software Engineer was asked Q1. Write a program for snake traversal of a binary tree.
A Software Engineer was asked Q2. Write code to check if a linked list is a palindrome in a single traversal and w...read more
A Software Engineer was asked Q3. Can you explain OOPS concepts like abstraction, encapsulation, inheritance, and ...read more
Stay ahead in your career. Get AmbitionBox app


Trusted by over 1.5 Crore job seekers to find their right fit company
80 L+
Reviews
10L+
Interviews
4 Cr+
Salaries
1.5 Cr+
Users
Contribute to help millions
AmbitionBox Awards
Get AmbitionBox app

