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
4d

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
Stay ahead in your career. Get AmbitionBox app
qr-code
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

Made with ❤️ in India. Trademarks belong to their respective owners. All rights reserved © 2024 Info Edge (India) Ltd.

Follow us
  • Youtube
  • Instagram
  • LinkedIn
  • Facebook
  • Twitter