Leetcode 739. Daily Temperatures

For each day in an array of daily temperatures, determine how many days you must wait until a warmer temperature appears (or 0 if none). This is a next-greater-element-to-the-right problem, typically solved in O(n) time using a monotonic decreasing stack to handle arrays up to 1e5 elements.

Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Company

Level

Region

Comments

Your account is free and you can post anonymously if you choose.

Hello Interview Premium

Recent interview questions

System Design Guided Practice

Exclusive content

Learn More

Leetcode 739. Daily Temperatures

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact