Use app×
Join Bloom Tuition
One on One Online Tuition
JEE MAIN 2025 Foundation Course
NEET 2025 Foundation Course
CLASS 12 FOUNDATION COURSE
CLASS 10 FOUNDATION COURSE
CLASS 9 FOUNDATION COURSE
CLASS 8 FOUNDATION COURSE
0 votes
78 views
in Information Technology by (124k points)
Can you implement a function to check if parentheses in an expression are balanced using a stack?

Please log in or register to answer this question.

1 Answer

0 votes
by (124k points)

Yes, here's an example Python code to check balanced parentheses:

def is_balanced(expression):
    stack = []
    mapping = {')': '(', '}': '{', ']': '['}

    for char in expression:
        if char in mapping.values():
            stack.append(char)
        elif char in mapping.keys():
            if stack == [] or mapping[char] != stack.pop():
                return False

    return stack == []

# Example usage:
expression = "{[()]}"

if is_balanced(expression):
    print(f"The expression '{expression}' is balanced.")
else:
    print(f"The expression '{expression}' is not balanced.")

Welcome to Sarthaks eConnect: A unique platform where students can interact with teachers/experts/students to get solutions to their queries. Students (upto class 10+2) preparing for All Government Exams, CBSE Board Exam, ICSE Board Exam, State Board Exam, JEE (Mains+Advance) and NEET can ask questions from any subject and get quick answers by subject teachers/ experts/mentors/students.

Categories

...