The Runtime Theory
mediumLeetCode#monotonic-stack#next-greater

Daily Temperatures

For each day, return how many days must pass until a strictly warmer temperature; use zero if none exists.

The Runtime Theory Team25 min read
Solve it

Solving happens on the judge — come back and mark it done

Sample cases

intemperatures=[73,74,75,71,69,72,76,73]

out[1,1,4,2,1,1,0,0]

intemperatures=[30,40,50,60]

out[1,1,1,0]

intemperatures=[30,30,30]

out[0,0,0]

For each day, return how many days must pass until a strictly warmer temperature; use zero if none exists.

A good solution should

  • State the invariant or decision rule that makes the approach correct.
  • Explain the time and space complexity in terms of the input sizes and required output.
  • Handle empty, minimal, duplicate, and boundary-shaped inputs covered by the contract.

Reasoning prompt

Keep unresolved indices in a decreasing stack and resolve them when a warmer value arrives. Equal temperatures do not resolve one another.

Use the linked judge for the canonical problem. The examples above are compact TRT checks; write additional cases before submitting, especially for the boundary that tends to break your chosen invariant.

More practice in this topic

medium · stackCar Fleetmedium · stackEvaluate Reverse Polish Notationmedium · stackGenerate Parentheses

One dispatch a week

The trace behind each problem, the tradeoff that explains it, and one technical dispatch per week — no noise.

One technical dispatch per week. No noise.

Not started

Sign in to save your learning progress.

Sign in to save