
Asked in Freshworks
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 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 p...read more
Help your peers!
Add answer anonymously...
Top Graduate Trainee Interview Questions Asked at Freshworks
Q. Given an array of integers, find if the array contains any duplicates. Your func...read more
Q. Optimize the code and improve its time and space complexity.
Q. Deepest Left Leaf Node Problem Statement You are provided with a binary tree con...read more
Interview Questions Asked to Graduate Trainee at Other Companies
Top Skill-Based Questions for Freshworks Graduate Trainee
Algorithms Interview Questions and Answers
250 Questions
Data Structures Interview Questions and Answers
250 Questions
SQL Interview Questions and Answers
250 Questions
Java Interview Questions and Answers
250 Questions
Networking Interview Questions and Answers
250 Questions
C++ Interview Questions and Answers
150 Questions
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

