Skip to content
QuizMaker logoQuizMaker
Activity
DSA Course: Interview Patterns and Problem Solving
Module 4: Stack & Queue
Best Time to Buy and Sell Stock: Greedy Pattern
Maximum Subarray: Kadane Pattern
Move Zeroes: Two pointers Pattern
Contains Duplicate: Set Pattern
Valid Anagram: Frequency map Pattern
Longest Substring Without Repeating Characters: Sliding window Pattern
Valid Palindrome: Two pointers Pattern
Longest Palindromic Substring: Expand around center Pattern
Group Anagrams: Hash key Pattern
Binary Search: Classic search Pattern
Search Insert Position: Lower bound Pattern
First Bad Version: Predicate search Pattern
Search in Rotated Sorted Array: Rotated search Pattern
Find Minimum in Rotated Sorted Array: Rotated minimum Pattern
Valid Parentheses: Stack matching Pattern
Min Stack: Auxiliary stack Pattern
Daily Temperatures: Monotonic stack Pattern
Next Greater Element I: Monotonic stack Pattern
Evaluate Reverse Polish Notation: Stack evaluation Pattern
Reverse Linked List: Pointer reversal Pattern
Merge Two Sorted Lists: Dummy node Pattern
Linked List Cycle: Fast and slow pointers Pattern
Middle of the Linked List: Fast and slow pointers Pattern
Remove Nth Node From End: Two pointers Pattern
Binary Tree Traversals: DFS recursion Pattern
Maximum Depth of Binary Tree: Height recursion Pattern
Binary Tree Level Order Traversal: BFS queue Pattern
Validate Binary Search Tree: Range bounds Pattern
Lowest Common Ancestor: Recursive split Pattern
Connected Components: Adjacency DFS Pattern
Number of Islands: Grid DFS Pattern
Flood Fill: Boundary DFS Pattern
Clone Graph: Hash Map DFS Pattern
Course Schedule: Topological Sort Pattern
Union Find Components: Disjoint Set Pattern
Shortest Path in Unweighted Graph: BFS Distance Pattern
Climbing Stairs: Fibonacci DP Pattern
House Robber: Pick or Skip DP Pattern
Coin Change: Minimum Coins DP Pattern
Longest Increasing Subsequence: Binary Search DP Pattern
Longest Common Subsequence: 2D DP Pattern
0/1 Knapsack: Capacity DP Pattern
Longest Consecutive Sequence: Hash Set Pattern
Subarray Sum Equals K: Prefix Sum Hashmap Pattern
First Unique Character: Frequency Map Pattern
Find Duplicates: Frequency Map Pattern
Ransom Note: Character Availability Pattern
Sort Colors: Dutch National Flag Pattern
Next Permutation: Pivot and Suffix Reversal Pattern
Merge Intervals: Sort and Sweep Pattern
Find First and Last Position: Boundary Binary Search Pattern
Search a 2D Matrix: Flattened Binary Search Pattern
Subsets: Pick or Skip Recursion Pattern
Generate Parentheses: Valid State Backtracking Pattern
Combination Sum: Reuse Choice Backtracking Pattern
N-Queens: Constraint Backtracking Pattern
Word Search: Grid Backtracking Pattern
Kth Largest Element: Size-K Min-Heap Pattern
Top K Frequent Elements: Frequency Heap Pattern
Merge K Sorted Lists: Min-Heap Multiway Merge Pattern
Median Finder: Two Heaps Pattern
Task Scheduler: Greedy Max-Heap Pattern
Jump Game: Farthest Reach Greedy Pattern
Gas Station: Greedy Reset Pattern
Non-overlapping Intervals: Earliest End Greedy Pattern
Minimum Arrows to Burst Balloons: Interval End Greedy Pattern
Partition Labels: Last Occurrence Greedy Pattern
Single Number: XOR Cancellation Pattern
Power of Two: n and n-1 Pattern
Number of 1 Bits: Brian Kernighan Pattern
Single Number III: Rightmost Set Bit Pattern
XOR From 1 to N: Modulo Cycle Pattern
Prime Check: Square Root Trial Division Pattern
Sieve of Eratosthenes: Prime Marking Pattern
GCD: Euclidean Remainder Pattern
Binary Exponentiation: Fast Power Pattern
Modular Inverse: Extended Euclid Pattern
Implement Trie: Prefix Tree Pattern
Longest Common Prefix: Single Branch Trie Pattern
LRU Cache: Hash Map Plus Recency List Pattern
Segment Tree: Range Sum Query Pattern
Fenwick Tree: Binary Indexed Prefix Sum Pattern
CONTENTS

Evaluate Reverse Polish Notation: Stack evaluation Pattern

Use a stack to evaluate postfix expressions as soon as operators appear.

DSA Course: Interview Patterns and Problem Solving
Module 4: Stack & Queue
dsa
data structures and algorithms
+4
May 28, 2026
29
A

Learning Outcome

After this lesson, you should be able to evaluate postfix expressions by storing operands until an operator is ready to apply.

Problem Statement

Given an array of tokens in Reverse Polish Notation, evaluate the expression and return the integer result. Operators are applied to the two most recent operands.

InputOutputWhy
["2","1","+","3","*"]9(2 + 1) * 3 = 9
["4","13","5","/","+"]64 + (13 / 5) = 6 with integer truncation toward zero.

Brute Force Approach

Repeatedly search the token list for an operator, apply it to the two previous numbers, replace the three tokens with the result, and continue.

This works conceptually, but repeated list edits are inefficient and awkward.

Optimized Approach

Use a stack. Push numbers. When an operator appears, pop the right operand first, then the left operand, apply the operator, and push the result back.

The operand order matters for subtraction and division.

Exact Pseudocode

stack = empty stack
for token in tokens:
  if token is a number:
    push integer(token)
  else:
    right = pop stack
    left = pop stack
    result = apply token to left and right
    push result
return stack.top

Reference Code

class Solution:
    def evalRPN(self, tokens):
        stack = []

        for token in tokens:
            if token not in {"+", "-", "*", "/"}:
                stack.append(int(token))
                continue

            right = stack.pop()
            left = stack.pop()

            if token == "+":
                stack.append(left + right)
            elif token == "-":
                stack.append(left - right)
            elif token == "*":
                stack.append(left * right)
            else:
                stack.append(int(left / right))

        return stack[-1]

Sample Dry Run

tokenstack beforeActionstack after
2[]Push number[2]
1[2]Push number[2,1]
+[2,1]Pop 1 and 2, push 3[3]
3[3]Push number[3,3]
*[3,3]Push 9[9]

Complexity

MeasureValueReason
TimeO(n)Each token is processed once.
SpaceO(n)The stack may store many operands.

Edge Cases

  • Negative number tokens such as "-11".
  • Subtraction and division require correct operand order.
  • Integer division truncates toward zero in the common problem definition.

Interview Checklist

  • Pop right operand first, then left operand.
  • Distinguish negative numbers from the minus operator.
  • Use truncation toward zero for division.

FAQs

Why does a stack fit RPN?

Operands wait until an operator arrives, and the most recent operands are used first.

Why does operand order matter?

left - right and left / right are not the same as reversing the operands.

What is the core pattern?

Stack-based expression evaluation.

Share this article

Share on TwitterShare on LinkedInShare on FacebookShare on WhatsAppShare on Email

Test your knowledge

Take a quick quiz based on this chapter.

mediumDSA Course
Evaluate Reverse Polish Notation - Stack evaluation Pattern Practice Quiz
5 questions8 min

0 comments

Please login to comment.
No comments yet.
Lesson 5 of 5 in Module 4: Stack & Queue
Previous in Module 4: Stack & Queue
Next Greater Element I: Monotonic stack Pattern
Completed!
You've finished this course
Back to DSA Course: Interview Patterns and Problem Solving
Back to moduleCategories