Reverse Polish Notation Evaluator | Dataford Interview Questions

Implement a parser and evaluator for a Reverse Polish Notation calculator.

Implement evaluate_rpn(expression), where expression is a whitespace-separated string containing integers and the binary operators +, -, *, and /. Return the resulting integer. Division must truncate toward zero. Inputs are valid expressions with no division by zero.

Constraints

1 <= number of tokens <= 1000
Each operand is a valid signed integer
Operators are limited to +, -, *, and /
The expression is valid and leaves exactly one result
Division by zero does not occur
Division truncates toward zero

Function Signature

def evaluate_rpn(expression):

Your question is Reverse Polish Notation Evaluator. 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

Implement a parser and evaluator for a Reverse Polish Notation calculator.

Constraints

1 <= number of tokens <= 1000
Each operand is a valid signed integer
Operators are limited to +, -, *, and /
The expression is valid and leaves exactly one result
Division by zero does not occur
Division truncates toward zero

Function Signature

def evaluate_rpn(expression):

Your question is Reverse Polish Notation Evaluator. 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.