MediumStacks Queues
Evaluate Reverse Polish Notation
amazongooglemicrosoftlinkedinbloombergoracle
You are given an array of strings tokens that represents an arithmetic expression in Reverse Polish Notation.
Evaluate the expression and return an integer that represents the value of the expression.
Note that:
- The valid operators are
'+','-','*', and'/'. - Each operand may be an integer or another expression.
- The division between two integers always truncates toward zero.
- There will not be any division by zero.
- The input represents a valid arithmetic expression in reverse polish notation.
- The answer and all the intermediate calculations can be represented in a 32-bit integer.
Examples
Example 1
Input
tokens = ["2","1","+","3","*"]
Output
9
((2 + 1) * 3) = 9
Example 2
Input
tokens = ["4","13","5","/","+"]
Output
6
(4 + (13 / 5)) = (4 + 2) = 6. Division truncates toward zero.
Example 3
Input
tokens = ["10","6","9","3","+","-11","*","/","*","17","+","5","+"]
Output
22
((10 * (6 / ((9 + 3) * -11))) + 17 + 5) = ((10 * 0) + 17 + 5) = 22
Constraints
- 1 <= tokens.length <= 104
- tokens[i] is either an operator: "+", "-", "*", or "/", or an integer in the range [-200, 200].
- The input represents a valid arithmetic expression in reverse polish notation.
- The answer and all intermediate calculations can be represented in a 32-bit integer.
Optimal complexity
Time
O(n)
Space
O(n)
One problem, two ways to prep
Choose between solo practice and interview simulation
Practice Mode keeps things simple with code + tests. AI Interview Mode adds voice, pressure, and a post-round score summary.