Stack

2 problems using this pattern

About this pattern:

LIFO data structure for parsing, expression evaluation, and nested structure problems.

Often used with: Monotonic Stack

Complexity Range

Time Complexity

O(n) (2 problems)

Space Complexity

O(n) (2 problems)

Problems Using Stack

Valid Parentheses

Determine if the input string of brackets is valid.

Easy LeetCode
Time: O(n)
Space: O(n)
Example: "()[]{}" → true
Stack
View Solution →

Daily Temperatures

For each day, return the number of days to wait for a warmer temperature.

Medium LeetCode
Time: O(n)
Space: O(n)
Example: [73,74,75,71,69,72,76,73] → [1,1,4,2,1,1,0,0]
Stack Monotonic Stack
View Solution →
← Back to All Patterns
View All Categories