Stack/Daily TemperaturesMedium

This practice workspace is built for desktop. Open it on a larger screen to start solving.

Daily Temperatures

Stack·Medium

Given an array of integers temperatures representing the daily temperatures, return an array answer such that answer[i] is the number of days you have to wait after the i-th day to get a warmer temperature.

If there is no future day for which this is possible, set answer[i] = 0.

This is a canonical monotonic stack problem: maintain a decreasing stack of indices waiting for a warmer day.

Examples

Input: temperatures = [73,74,75,71,69,72,76,73]

Output: [1,1,4,2,1,1,0,0]

Input: temperatures = [30,40,50,60]

Output: [1,1,1,0]

Input: temperatures = [30,60,90]

Output: [1,1,0]

Constraints

1 <= temperatures.length <= 10^5
30 <= temperatures[i] <= 100

00:00Preview Mode (Read Only)

Loading editor…

Tests

Preview Mode

This is a read-only preview of DSAMind's AI coaching. Sign up to get custom feedback on your own solution.

Passed32 ms

First attempt — retry to track metric movement here.

Your approach

Pattern:Stack
Time:O(N)
Space:O(1)

Complete approach — pattern and complexity both named.

Coach

What you got right

You correctly matched the sorted input requirement and implemented a linear-time scan using two pointers.

Where it diverged

No divergence detected. The code correctly aligns with the stated approach.

Next attempt: focus on

Try solving related sliding window problems to build familiarity with two-pointer variants.

Signals

No signals fired — clean run, you stayed in flow.