Asked in Publicis Sapient,Junior Associate: Marketing Strategy and Analysis

Valid Parenthesis Problem Statement

Given a string str composed solely of the characters "{", "}", "(", ")", "[", and "]", determine whether the parentheses are balanced.

Input:

The first line contains an integer 'T' representing the number of test cases. For each test case, there is a single line containing a string as described.

Output:

For each test case, output a single line indicating if the string is balanced or not.

Example:

Input:
T = 2
STR = "{[()]}"
STR = "{[(])}"
Output:
YES
NO
Explanation:

The first string is balanced whereas the second is not.

Constraints:

  • 1 <= T <= 10
  • 1 <= N <= 10^5
  • Where N is the length of the input string.
  • Time Limit: 1 sec

Note:

You are not required to print anything explicitly. Just implement the function.
Be the first one to answer
Select
Add answer anonymously...
Publicis Sapient Junior Associate: Marketing Strategy and Analysis Interview Questions
Stay ahead in your career. Get AmbitionBox app
play-icon
play-icon
qr-code
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

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

Follow Us
  • Youtube
  • Instagram
  • LinkedIn
  • Facebook
  • Twitter
Profile Image
Hello, Guest
AmbitionBox Employee Choice Awards 2025
Winners announced!
awards-icon
Contribute to help millions!
Write a review
Write a review
Share interview
Share interview
Contribute salary
Contribute salary
Add office photos
Add office photos
Add office benefits
Add office benefits