Stack pattern
Daily Temperatures
Given an array of daily temperatures, return an array where each entry is the number of days you must wait after that day to encounter a warmer temperature. Use 0 if no warmer day ever follows. Watch it run step by step, then write your own pseudocode and get it checked by AI.
- LeetCode 739
- Medium
- 2 approaches
Sign in with Google or GitHub and you land straight on this page. DSA comes with the all labs plan and every ChaiCode batch.
StackLeetCode 739
Medium
From the first idea to the best one
- 01 Brute force · scan right from every day O(n²)O(1) space
- 02 Optimized · monotonic stack of waiting days O(n)O(n) space
What you will learn
- How to read Daily Temperatures and spot the stack pattern in it
- Brute force · scan right from every day: O(n²) time, O(1) space
- Optimized · monotonic stack of waiting days: O(n) time, O(n) space
- The pseudocode for each approach, its line lit as the animation runs
- Practice: write your own pseudocode and get it checked
More Stack
See Daily Temperatures run, step by step
Sign in and this page opens on the animation, with all 8 Stack problems beside it.
DSA comes with the all labs plan and every ChaiCode batch.