Balanced Parentheses | Sololearn: Learn to code for FREE!
New course! Every coder should learn Generative AI!
Try a free lesson
+ 1

Balanced Parentheses

Balanced Parentheses Parentheses are balanced, if all opening parentheses have their corresponding closing parentheses. Given an expression as input, we need to find out whether the parentheses are balanced or not. For example, "(x+y)*(z-2*(6))" is balanced, while "7-(3(2*9))4) (1" is not balanced. The problem can be solved using a stack. Push each opening parenthesis to the stack and pop the last inserted opening parenthesis whenever a closing parenthesis is encountered. If the closing bracket does not correspond to the opening bracket, then stop and say that the brackets are not balanced. Also, after checking all the parentheses, we need to check the stack to be empty -- if it's not empty, then the parentheses are not balanced. Implement the balanced() function to return True if the parentheses in the given expression are balanced, and False if not. Sample Input: (a( ) eee) ) Sample Output: False

1st Oct 2022, 6:36 AM
Tran Xuan Huy
4 Answers
+ 3
Add hint: push each opening parenthesis to the stack and pop the last inserted opening parenthesis whenever a closing parenthesis is encountered.
1st Oct 2022, 2:24 PM
JaScript
JaScript - avatar
+ 3
Pls add in the question description a link to your code in Code Playground and an explanation of your difficulties. Also, pls fix the tags by removing all of them and adding one with the language name.
2nd Oct 2022, 4:02 AM
Emerson Prado
Emerson Prado - avatar
+ 1
Hint: you could solve it with using a stack principle and take the parethesis there.
1st Oct 2022, 7:51 AM
JaScript
JaScript - avatar
+ 1
can anyone help me solve this problem.
1st Oct 2022, 1:36 PM
Poornima C