Search
⌘K

Leetcode 150. Evaluate Reverse Polish Notation

Evaluate the integer value of an expression given in Reverse Polish Notation, where tokens are integers or the operators +, -, *, / and all intermediate results fit in 32-bit. The core challenge is to process tokens in one pass (commonly with a stack), applying operators to operands and ensuring division truncates toward zero.

Asked at:

Google

Google


Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Early November, 2024

Google

Google

Mid-level

Resolve an expression similar to evaluating reverse Polish notation

Comments

Your account is free and you can post anonymously if you choose.