Question: IN LUA , write a program that: Problem #2: Check Balanced Parentheses Given a string of opening and closing parentheses, check whether it's balanced. We
IN LUA, write a program that:

Problem #2: Check Balanced Parentheses Given a string of opening and closing parentheses, check whether it's balanced. We have 3 types of parentheses: round brackets: ), square brackets: 0, and curly brackets: 0. Assume that the string doesn't contain any other character than these, no spaces words or numbers. Just to remind, balanced parentheses require every opening parenthesis to be closed in the reverse order opened. Sample Input: (Ho) Output: YES Sample Input: Output: NO
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
