Why Balanced Parentheses Problem Using Stack in DSA C?

The Big Idea

What if you could instantly spot mismatched brackets in your code without getting lost?

The Scenario

Imagine you have a long math expression or code with many parentheses, like ( ( [ ] { } ) ). You want to check if every opening bracket has a matching closing one in the right order.

Doing this by looking at each character and remembering what you saw before is like trying to keep track of many open boxes without a list. It gets confusing fast!

The Problem

Manually checking each bracket is slow and easy to mess up, especially when brackets are nested or mixed types like (), [], {}.

You might forget which bracket opened last or miss a closing one, causing errors in your program or math.

The Solution

The stack data structure acts like a neat pile where you put each opening bracket on top.

When you see a closing bracket, you check the top of the stack to see if it matches. If it does, you remove it. This way, you always remember the last opened bracket and can quickly verify pairs.

Before vs After

✗ Before

int i = 0;
while (expression[i] != '\0') {
  if (expression[i] == '(') {
    // remember opening bracket manually
  }
  else if (expression[i] == ')') {
    // check if last opening was '('
  }
  i++;
}

✓ After

Stack stack;
initStack(&stack);
for (int i = 0; expression[i] != '\0'; i++) {
  if (isOpeningBracket(expression[i])) {
    push(&stack, expression[i]);
  } else if (isClosingBracket(expression[i])) {
    if (stackIsEmpty(&stack) || !matches(pop(&stack), expression[i])) {
      return false;
    }
  }
}
return stackIsEmpty(&stack);

What It Enables

This method lets you quickly and correctly check if any expression or code has balanced brackets, preventing errors and bugs.

Real Life Example

Compilers use this to check if your code has matching parentheses, braces, and brackets before running it, so your program doesn't crash.

Key Takeaways

Manual checking of brackets is confusing and error-prone.

Using a stack helps track the last opened bracket easily.

This ensures fast and correct validation of balanced parentheses.

Practice

1. What is the main purpose of using a stack in the Balanced Parentheses problem?

easy

A. To keep track of opening parentheses and match them with closing ones

B. To count the total number of parentheses in the expression

C. To reverse the order of parentheses in the expression

D. To store only the closing parentheses encountered

Solution

1. Step 1: Understand the role of stack in parentheses matching

   A stack helps to remember the last opening parenthesis to match it with the next closing one.

2. Step 2: Identify why other options are incorrect

   Counting or reversing parentheses does not solve matching pairs; storing only closing parentheses misses the matching logic.

3. Final Answer:

   To keep track of opening parentheses and match them with closing ones -> Option A

4. Quick Check:

   Stack tracks openings for matching = B [OK]

Hint: Stack remembers last opening bracket for matching [OK]

Common Mistakes:

• Thinking stack counts parentheses instead of matching
• Using stack to store only closing parentheses
• Ignoring order of parentheses

2. Which of the following code snippets correctly pushes an opening parenthesis '(' onto a stack named stack in C?

easy

A. push(stack, '(');

B. stack.push('(');

C. stack->push('(');

D. push('(', stack);

Solution

1. Step 1: Recognize typical C stack push syntax

   In C, stack operations are usually functions like push(stack, element).

2. Step 2: Analyze each option

   push(stack, '('); matches the common C function call syntax. Options B and C use dot or arrow notation typical in C++ or OOP, not plain C. push('(', stack); has arguments reversed.

3. Final Answer:

   push(stack, '('); -> Option A

4. Quick Check:

   C stack push syntax = A [OK]

Hint: In C, use push(stack, element) function call [OK]

Common Mistakes:

• Using C++ style stack.push() in C
• Reversing arguments in push function
• Using arrow operator on non-pointer stack

3. What will be the output of the following C code snippet that checks balanced parentheses?

char expr[] = "({[]})";
int result = isBalanced(expr);
printf("%d", result);

Assume isBalanced returns 1 if balanced, 0 otherwise.

medium

A. Runtime error

B. 0

C. Compilation error

D. 1

Solution

1. Step 1: Analyze the expression "({[]})"

   The expression has matching pairs: '(' with ')', '{' with '}', '[' with ']'. All are properly nested.

2. Step 2: Understand isBalanced function behavior

   Since the expression is balanced, isBalanced returns 1, so printf prints 1.

3. Final Answer:

   1 -> Option D

4. Quick Check:

   Balanced expression returns 1 = A [OK]

Hint: Balanced nested pairs return 1 from isBalanced [OK]

Common Mistakes:

• Assuming only () pairs are valid
• Confusing balanced with equal count
• Expecting 0 for nested but balanced

4. Identify the bug in this C function snippet for checking balanced parentheses:

int isBalanced(char* expr) {
  Stack s;
  for (int i = 0; expr[i] != '\0'; i++) {
    if (expr[i] == '(') push(&s, '(');
    else if (expr[i] == ')') {
      if (isEmpty(&s)) return 0;
      pop(&s);
    }
  }
  return isEmpty(&s);
}

medium

A. Return statement should be inside the loop

B. Stack s is not initialized before use

C. pop() is called without checking if stack is empty

D. The function does not check for other types of brackets

Solution

1. Step 1: Check stack initialization

   The stack variable 's' is declared but not initialized, so push/pop operations may fail.

2. Step 2: Verify other parts

   Other options are less critical: checking only () is a limitation but not a bug; pop is called after empty check; return outside loop is correct.

3. Final Answer:

   Stack s is not initialized before use -> Option B

4. Quick Check:

   Uninitialized stack causes errors = D [OK]

Hint: Always initialize stack before push/pop [OK]

Common Mistakes:

• Ignoring stack initialization
• Assuming pop safe without empty check
• Thinking return must be inside loop

5. Given the expression "[{()}](({}))", which of the following modifications to the isBalanced function will correctly handle all types of brackets: (), {}, and []?

hard

A. Ignore brackets inside quotes and only check outer brackets

B. Count total opening and closing brackets separately and compare counts

C. Push opening brackets and check matching closing brackets by popping and comparing types

D. Replace all brackets with parentheses before checking

Solution

1. Step 1: Understand bracket matching logic

   To handle multiple bracket types, push opening brackets and on closing bracket, pop and check if types match.

2. Step 2: Evaluate other options

   Counting brackets ignores order; ignoring brackets inside quotes is unrelated; replacing brackets loses type info.

3. Final Answer:

   Push opening brackets and check matching closing brackets by popping and comparing types -> Option C

4. Quick Check:

   Match types by push/pop for all brackets = C [OK]

Hint: Match each closing bracket with last opening of same type [OK]

Common Mistakes:

• Counting brackets without order check
• Ignoring bracket types
• Replacing brackets loses matching info