Question: This problem has been solved! See the answer You are given three kinds of parenthesis expressions. Write a function that returns the longest balanced expression.
This problem has been solved!
See the answer
You are given three kinds of parenthesis expressions. Write a function that returns the longest balanced expression. Also write a function that checks whether the given expression is right or not. (Use stack c++)
Example 1:
input: (){}[]()()()[]
output: ()()()
Example 2:
input: ({)}{}[]
output: alignment is ok
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
