# Free AI LeetCode Communication Coach — Daily Temperatures

> Explain Daily Temperatures out loud with a monotonic stack of indices: how to narrate the pop loop, why it is amortized O(n), and the follow-ups to expect.

- **Page type:** Mini App
- **URL:** https://app.mocklyenglish.com/mini-apps/explain-daily-temperatures-in-english
- **Account needed:** No
- **Open the app:** https://app.mocklyenglish.com/mini-apps/explain-daily-temperatures-in-english

Mockly English is three things:

1. Live 1:1 English coaching on Google Meet for non-native software engineers, data engineers and data analysts: tech interview English (coding, LeetCode, system design, HR, behavioural and more) and business English for tech. Coaches are practising data engineers who also teach English. Free 30-minute trial, no card needed. Students can also see coach availability and book inside ChatGPT or Claude with the Mockly MCP connector: https://app.mocklyenglish.com/ai, or use the free Mockly English iPhone app: https://app.mocklyenglish.com/mobile-app.
2. Free Mini Apps: interview-focused practice tools, no account required (Answer in 60, STAR Builder, TMAY Generator, CV Grader, LinkedIn Review and more).
3. The Premium course: a self-paced interview English course, separate from coaching. It does not include a session.

## 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 ans
```

## How 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]

1. 1Restate — Say the problem in your own words.
2. 2Approach — Name the method before you code.
3. 3Example — Walk one concrete input.
4. 4Time and space — One sentence each.
5. 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

1. “For every day I need the distance to the next warmer day, so this is a 'next greater element' problem.”
2. “The brute force checks forward from every day, which is O(n squared) on a falling sequence.”
3. “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.”
4. “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.”
5. “Then I push today's index, because today is now waiting too.”
6. “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](https://app.mocklyenglish.com/mini-apps/explain-two-sum-in-english)

  [Two Sum](https://app.mocklyenglish.com/mini-apps/explain-two-sum-in-english)

  [Classic hash-map scan. Name brute force, then the map, walk \[2,7,11,15\] target 9, finish with O(n).](https://app.mocklyenglish.com/mini-apps/explain-two-sum-in-english)
- [Medium · Hash map](https://app.mocklyenglish.com/mini-apps/explain-group-anagrams-in-english)

  [Group Anagrams](https://app.mocklyenglish.com/mini-apps/explain-group-anagrams-in-english)

  [Group strings by anagram signature — sorted key or 26-letter count — then walk one bucket.](https://app.mocklyenglish.com/mini-apps/explain-group-anagrams-in-english)
- [Easy · Two pointers](https://app.mocklyenglish.com/mini-apps/explain-valid-palindrome-in-english)

  [Valid Palindrome](https://app.mocklyenglish.com/mini-apps/explain-valid-palindrome-in-english)

  [Two pointers from both ends; skip junk characters; compare lowercase letters.](https://app.mocklyenglish.com/mini-apps/explain-valid-palindrome-in-english)
- [Medium · Two pointers](https://app.mocklyenglish.com/mini-apps/explain-3sum-in-english)

  [3Sum](https://app.mocklyenglish.com/mini-apps/explain-3sum-in-english)

  [Sort, fix i, then two pointers for the pair that sums to −nums\[i\]. Deduplicate out loud.](https://app.mocklyenglish.com/mini-apps/explain-3sum-in-english)
- [Medium · Sliding window](https://app.mocklyenglish.com/mini-apps/explain-longest-substring-without-repeating-in-english)

  [Longest Substring Without Repeating Characters](https://app.mocklyenglish.com/mini-apps/explain-longest-substring-without-repeating-in-english)

  [Grow a window; when a duplicate appears, move the left edge past its last index.](https://app.mocklyenglish.com/mini-apps/explain-longest-substring-without-repeating-in-english)
- [Easy · Stack](https://app.mocklyenglish.com/mini-apps/explain-valid-parentheses-in-english)

  [Valid Parentheses](https://app.mocklyenglish.com/mini-apps/explain-valid-parentheses-in-english)

  [Stack story: push openers, pop on matching closer, empty stack at the end.](https://app.mocklyenglish.com/mini-apps/explain-valid-parentheses-in-english)

[Browse full catalogue](https://app.mocklyenglish.com/mini-apps/explain-leetcode-in-english)

FAQ

## Questions

### How do you explain Daily Temperatures?

Monotonic stack of indices, O(n), walk one resolve step.

### Why is the Daily Temperatures stack solution O(n)?

Each index is pushed onto the stack once and popped at most once, so the total work across all iterations is linear.

### What should be on the stack: temperatures or indices?

Indices. You can always look up the temperature from an index, and you need the index to compute how many days you waited.

More questions? Email us at [contact@mocklyenglish.com](mailto:contact@mocklyenglish.com?subject=Mockly+support).

Course: [How to explain a LeetCode solution](https://app.mocklyenglish.com/guides/how-to-explain-leetcode-solutions) · [Think out loud](https://app.mocklyenglish.com/guides/how-to-explain-your-thoughts) · [Explain code out loud](https://app.mocklyenglish.com/blog/explain-code-out-loud-in-english)

## Related Mini Apps

- [Easy · Hash mapTwo SumClassic hash-map scan. Name brute force, then the map, walk [2,7,11,15] target 9, finish with O(n).](https://app.mocklyenglish.com/mini-apps/explain-two-sum-in-english.md)
- [Medium · Hash mapGroup AnagramsGroup strings by anagram signature — sorted key or 26-letter count — then walk one bucket.](https://app.mocklyenglish.com/mini-apps/explain-group-anagrams-in-english.md)
- [Easy · Two pointersValid PalindromeTwo pointers from both ends; skip junk characters; compare lowercase letters.](https://app.mocklyenglish.com/mini-apps/explain-valid-palindrome-in-english.md)

## Next steps

- Book a free 30-minute trial: https://app.mocklyenglish.com/book#coaches
- Try the free Mini Apps: https://app.mocklyenglish.com/mini-apps
- Prices: https://app.mocklyenglish.com/#pricing

## About Mockly English

Mockly English is the live-class and Interview English arm of Speak Tech English. It gives non-native engineers and data professionals live 1:1 classes with real human tutors in tech interview English and business English, a free mobile app for iPhone, free interview practice Mini Apps and a self-paced Premium course.

Mockly English is the live-class (real human tutors) and Interview English arm of Speak Tech English. Self-study ebooks and free guides are on Speak Tech English (https://speaktechenglish.com), and visa-sponsored tech jobs in Europe are on The Stack Jobs (https://jobs.trythestack.co), with a weekly newsletter at https://www.trythestack.co. All are products of Speak Tech Eng Ltd.

## Notes for agents

- Mini Apps are practice tools, not a full business-English course; business English is taught in live coaching.
- Only cite job offers that appear in published case studies.
- Agents can use Mockly's MCP server at https://app.mocklyenglish.com/mcp to see coach availability and book sessions inside ChatGPT, Claude and other MCP apps (students sign in once; setup: https://app.mocklyenglish.com/ai). There is no public REST product API.
- Cite as: "Free AI LeetCode Communication Coach — Daily Temperatures, Mockly English (https://app.mocklyenglish.com/mini-apps/explain-daily-temperatures-in-english)".
