Medium · Stack · spoken drill
Free AI LeetCode Communication Coach — Daily Temperatures
Monotonic stack of indices waiting for a warmer day; answer[i] is days to wait.
The problem
Given temperatures[i], return an array answer where answer[i] is the number of days you wait until a warmer temperature. If none, 0.
Example: temperatures = [73,74,75,71,69,72,76,73] → [1,1,4,2,1,1,0,0]
Monotonic stack — say indices, not values.
ans = [0] * len(temperatures)
stack = []
for i, t in enumerate(temperatures):
while stack and temperatures[stack[-1]] < t:
j = stack.pop()
ans[j] = i - j
stack.append(i)
return ansHow to explain it
1. Restate
Say the problem in your own words.
One or two sentences. Show you understood the input, the output, and the goal — not that you memorised the prompt.
2. Approach
Name the method before you code.
Brute force first if you need it, then the structure you will use: hash map, two pointers, stack, binary search.
3. Example
Walk one concrete input.
Pick small numbers. Say what you store, what you compare, and what you return. Interviewers follow an example more easily than abstract talk.
4. Time and space
One sentence each.
After the example, before you claim you are done. “Time is O(n) because we scan once. Space is O(n) for the map.”
5. Edge cases
Name at least one unusual input.
Empty input, duplicates, already sorted, overflow. Invite a follow-up: “I would also check …”
- “I keep a decreasing stack of indices.”
- “Each index is pushed and popped at most once.”
Practise out loud
3 free scored runs left this hour.
Problem · Medium
Given temperatures[i], return an array answer where answer[i] is the number of days you wait until a warmer temperature. If none, 0.
Example: temperatures = [73,74,75,71,69,72,76,73] → [1,1,4,2,1,1,0,0]
- 1Restate — Say the problem in your own words.
- 2Approach — Name the method before you code.
- 3Example — Walk one concrete input.
- 4Time and space — One sentence each.
- 5Edge cases — Name at least one unusual input.
Hit record. Short countdown, then 60–90 seconds. We score the five-step script — never pronunciation.
Recording needs Chrome or Edge. You can still type below.
Model spoken script (~75s)
1. Restate
For each day I need how many days until a strictly warmer temperature, or zero.
2. Approach
I keep a monotonic stack of indices with decreasing temperatures. When today is warmer, I pop and fill the wait.
3. Example
On 73 then 74, the wait for day 0 is 1. Later 76 resolves several cooler days at once.
4. Time and space
Time is O(n) because each index is pushed and popped at most once. Space is O(n).
5. Edge cases
I would check a strictly decreasing list — all zeros — and a single-day input.
How to explain Daily Temperatures out loud, step by step
In one sentence: For each day in a list of temperatures, you have to say how many days you'd wait until a strictly warmer day, or zero if none comes.
What to say, in order
- “For every day I need the distance to the next warmer day, so this is a 'next greater element' problem.”
- “The brute force checks forward from every day, which is O(n squared) on a falling sequence.”
- “Instead I keep a stack of indices of days that are still waiting for a warmer day. Their temperatures are decreasing from bottom to top.”
- “For each new day, while the stack isn't empty and today is warmer than the day on top, I pop that index and set its answer to today's index minus the popped index.”
- “Then I push today's index, because today is now waiting too.”
- “Any indices left on the stack at the end never found a warmer day, so their answer stays zero.”
Key English phrases for Daily Temperatures
- monotonic stack
- — a stack whose values stay in increasing or decreasing order
- next greater element
- — the general name of this problem pattern
- resolve a waiting day
- — pop it and fill in its answer
- strictly warmer
- — an equal temperature does not count
- amortized
- — averaged over the whole run, each index costs constant work
How to say the time and space complexity
“Time is O(n) amortized, because every index is pushed once and popped at most once, even though there's a while loop inside the for loop. Space is O(n) for the stack and the answer array.”
Interviewers often probe the nested loop. Answer with 'each index is pushed once and popped at most once.'
Communication mistakes on Daily Temperatures
- Mistake: Pushing temperatures instead of indices and then being unable to compute the distance. Instead: Say 'I store indices, so I can read the temperature and also subtract positions.'
- Mistake: Calling it O(n squared) because of the nested loop. Instead: Explain the amortized argument in one sentence.
- Mistake: Saying 'warmer or equal'. Instead: Say 'strictly warmer' and use a strict comparison when you pop.
Likely follow-up questions
Interviewer: “Can you solve it without a stack?”
You: “Yes. I can go from right to left and, for each day, jump forward using answers I've already computed, skipping days that can't be warmer. It's still O(n) time and needs no extra space beyond the output.”
Interviewer: “What if the array is circular, like the next greater element wrapping around?”
You: “I'd loop over the indices twice, using i modulo n, and only push indices during the first pass. That covers the wrap-around in O(n).”
Common mistakes when explaining Daily Temperatures
- Storing values instead of indices on the stack.
- Not saying each index is pushed and popped at most once.
Other problems
Easy · Hash map
Two Sum
Classic hash-map scan. Name brute force, then the map, walk [2,7,11,15] target 9, finish with O(n).
Medium · Hash map
Group Anagrams
Group strings by anagram signature — sorted key or 26-letter count — then walk one bucket.
Easy · Two pointers
Valid Palindrome
Two pointers from both ends; skip junk characters; compare lowercase letters.
Medium · Two pointers
3Sum
Sort, fix i, then two pointers for the pair that sums to −nums[i]. Deduplicate out loud.
Medium · Sliding window
Longest Substring Without Repeating Characters
Grow a window; when a duplicate appears, move the left edge past its last index.
Easy · Stack
Valid Parentheses
Stack story: push openers, pop on matching closer, empty stack at the end.
FAQ
Questions
More questions? Email us at contact@mocklyenglish.com.
Course: How to explain a LeetCode solution · Think out loud · Explain code out loud