You are coding as a Guest. Sign in with your RoleNest account to permanently track your streak, earn XP, and climb the Campus Leaderboard!
Sign In with RoleNestProblem Set
🔥Daily Temperatures: Monotonic StackMedium
MediumStack•Acceptance: 66.2%
Daily Temperatures: Monotonic Stack
Real-World Engineering Context
Stock ticker breakout prediction and next-higher price signal lookahead in algorithmic trading engines.
Given an array of integers `temperatures` representing 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, keep `answer[i] == 0`.
Sample Test Cases
Input: [[73,74,75,71,69,72,76,73]]
Expected: [1,1,4,2,1,1,0,0]
Input: [[30,40,50,60]]
Expected: [1,1,1,0]
Input: [[30,60,90]]
Expected: [1,1,0]
Constraints
- 1 <= temperatures.length <= 10^5
- 30 <= temperatures[i] <= 100
Language:
Ready to test. Click Run Code or Submit Solution to run test cases in isolated browser sandbox.