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.
Be the first one to answer
Add answer anonymously...
Top LTIMindtree Software Developer interview questions & answers
Popular interview questions of Software Developer
Top HR questions asked in LTIMindtree Software Developer
Stay ahead in your career. Get AmbitionBox app
Helping over 1 Crore job seekers every month in choosing their right fit company
65 L+
Reviews
4 L+
Interviews
4 Cr+
Salaries
1 Cr+
Users/Month
Contribute to help millions
Get AmbitionBox app