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

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

3rd Oct 2021, 4:48 AM
M.G.Kawya Nadun
M.G.Kawya Nadun - avatar
2 Answers
+ 3
Your question is incomplete, could you please post the language you are trying to solve that with and your attempt? Also the problem text contains pretty much everything you need for a solution, if you know basics of the language you are trying to solve this with...
3rd Oct 2021, 5:02 AM
Aleksei Radchenkov
Aleksei Radchenkov - avatar