The Runtime Theory
mediumLeetCode#stack#expression-evaluation

Evaluate Reverse Polish Notation

Evaluate an expression whose operators follow their operands, using integer arithmetic with truncation toward zero.

The Runtime Theory Team25 min read
Solve it

Solving happens on the judge — come back and mark it done

Sample cases

intokens=["2","1","+","3","*"]

out9

intokens=["4","13","5","/","+"]

out6

intokens=["-7","2","/"]

out-3

Evaluate an expression whose operators follow their operands, using integer arithmetic with truncation toward zero.

A good solution should

  • State the invariant or decision rule that makes the approach correct.
  • Explain the time and space complexity in terms of the input sizes and required output.
  • Handle empty, minimal, duplicate, and boundary-shaped inputs covered by the contract.

Reasoning prompt

Pop the right operand before the left operand. Division with negative inputs must follow truncation toward zero, not floor division.

Use the linked judge for the canonical problem. The examples above are compact TRT checks; write additional cases before submitting, especially for the boundary that tends to break your chosen invariant.

More practice in this topic

One dispatch a week

The trace behind each problem, the tradeoff that explains it, and one technical dispatch per week — no noise.

One technical dispatch per week. No noise.

Not started

Sign in to save your learning progress.

Sign in to save