Practice Daily Temperatures
Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.
Problem Statement
Given an array of integers temperatures represents the daily temperatures, return an array answer such that answer[i] is the number of days you have to wait after the ith day to get a warmer temperature. If there is no future day for which this is possible, keep answer[i] == 0 instead.
Source: Daily Temperatures on LeetCode. Use the original task for its coding environment and submissions.
Examples
# Example 1
Input
temperatures = [73,74,75,71,69,72,76,73]
Output
[1,1,4,2,1,1,0,0]
# Example 2
Input
temperatures = [30,40,50,60]
Output
[1,1,1,0]
# Example 3
Input
temperatures = [30,60,90]
Output
[1,1,0]
Constraints
1 <= temperatures.length <= 10^5
30 <= temperatures[i] <= 100
Related LeetCode Problems
Practice more problems similar to Daily Temperatures.
Review your practice with PhantomCodeAI
After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.