Stack-Based Parsing and Evaluation | Dataford Interview Questions

Solve classical stack-based problems, such as matching nested brackets or evaluating postfix expressions.

Implement solve_stack_problems(brackets, postfix_tokens). Return whether brackets is properly nested and the integer result of the valid postfix expression. Supported operators are +, -, *, and /, with division truncated toward zero. Inputs contain valid tokens and no division by zero.

Constraints

0 <= len(brackets) <= 1000
1 <= len(postfix_tokens) <= 1000
brackets contains only '(', ')', '[', ']', '{', and '}'
Each postfix token is a base-10 integer or one of '+', '-', '*', '/'
The postfix expression is valid and contains no division by zero
Intermediate and final postfix results fit within Python integer limits

Function Signature

def solve_stack_problems(brackets, postfix_tokens):

Your question is Stack-Based Parsing and Evaluation. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

Problem

Solve classical stack-based problems, such as matching nested brackets or evaluating postfix expressions.

Constraints

0 <= len(brackets) <= 1000
1 <= len(postfix_tokens) <= 1000
brackets contains only '(', ')', '[', ']', '{', and '}'
Each postfix token is a base-10 integer or one of '+', '-', '*', '/'
The postfix expression is valid and contains no division by zero
Intermediate and final postfix results fit within Python integer limits

Function Signature

def solve_stack_problems(brackets, postfix_tokens):

Your question is Stack-Based Parsing and Evaluation. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.