# Leetcode - Daily Temperatures Solution

Given a list of daily temperatures T, return a list such that, for each day in the input, tells you how many days you would have to wait until a warmer temperature. If there is no future day for which this is possible, put 0 instead.

For example, given the list of temperatures T = [73, 74, 75, 71, 69, 72, 76, 73], your output should be [1, 1, 4, 2, 1, 1, 0, 0].

Note: The length of temperatures will be in the range [1, 30000]. Each temperature will be an integer in the range [30, 100].

## Solution in Python

class Solution:
def dailyTemperatures(self, T: List[int]) -> List[int]:
output = [0]*len(T)
warmer = [300002]*102
for index,value in reversed(list(enumerate(T))):
nearest_warmer = min(warmer[i] for i in range(value+1,102))
if nearest_warmer != 300002:
output[index] = nearest_warmer-index
warmer[value] = index
return output

### Subscribe to The Poor Coder | Algorithm Solutions

Don’t miss out on the latest issues. Sign up now to get access to the library of members-only issues.
[email protected]
Subscribe