Implementing Stacks & Queues

What common stack application is implemented by this function?

function isBalanced(expression) {
  const stack = [];
  const pairs = { '(': ')', '[': ']', '{': '}' };
  
  for (let char of expression) {
    if (char in pairs) {
      stack.push(char);
    } else if (Object.values(pairs).includes(char)) {
      if (pairs[stack.pop()] !== char) return false;
    }
  }
  
  return stack.length === 0;
}

Expression evaluation
Parentheses matching
This implements bracket matching by: 1) Using stack to track opening brackets, 2) Matching closing brackets with most recent opening bracket, 3) Ensures proper nesting of different bracket types, 4) Validates balanced parenthetical expressions, 5) Common in syntax checking for programming languages, 6) Essential for parsing nested structures, 7) Efficient O(n) time complexity solution, 8) Standard application of stack data structure.
String reversal
Path finding

Next Question (12/20)