Daily Temperatures Problem

Daily Temperatures Problem — ExecCode Medium DSA Practice

Solve the Daily Temperatures problem on ExecCode. Free online medium DSA practice in Stack. Write and run code in Java, C++, Python — no signup required to run.

Problem description

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ᵗʰ day to get a warmer temperature. If there is no future day for which this is possible, keep answer[i] == 0.

Examples

Input temperatures = [73, 74, 75, 71, 69, 72, 76, 73, 78, 70]; Output [1, 1, 4, 2, 1, 1, 2, 1, 0, 0]. 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]

Constraints

1 ≤ temperatures.length ≤ 10⁵ 30 ≤ temperatures[i] ≤ 100

Practice Daily Temperatures free on ExecCode. Browse DSA problems, topic map, and placement guides.