# Free AI LeetCode Communication Coach — Climbing Stairs

> Explain Climbing Stairs out loud: the recurrence, base cases, rolling variables, how to say O(n) time and O(1) space, and the k-steps follow-up.

- **Page type:** Mini App
- **URL:** https://app.mocklyenglish.com/mini-apps/explain-climbing-stairs-in-english
- **Account needed:** No
- **Open the app:** https://app.mocklyenglish.com/mini-apps/explain-climbing-stairs-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

You can climb 1 or 2 steps. How many distinct ways to climb n stairs?

Example: n = 3 → 3 (1+1+1, 1+2, 2+1)

Recurrence first, then rolling vars.

```
if n <= 2:
    return n
a, b = 1, 2
for _ in range(3, n + 1):
    a, b = b, a + b
return b
```

## 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 …”

- “Ways(n) is ways(n-1) plus ways(n-2).”
- “I keep only the last two values.”

## Practise out loud

3 free scored runs left this hour.

Problem · Easy

You can climb 1 or 2 steps. How many distinct ways to climb n stairs?

Example: n = 3 → 3 (1+1+1, 1+2, 2+1)

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

   I need the number of ways to reach the top taking one or two steps at a time.

2. Approach

   This is Fibonacci. Ways to reach n equal ways to n−1 plus ways to n−2. I compute bottom-up with two variables.

3. Example

   For n = 3 the ways are three: 1+1+1, 1+2, and 2+1.

4. Time and space

   Time is O(n). Space is O(1).

5. Edge cases

   I would check n equals one and n equals two as base cases.

## How to explain Climbing Stairs out loud, step by step

**In one sentence:** You have to count how many different sequences of one-step and two-step moves take you from the bottom of a staircase to exactly the top.

### What to say, in order

1. “To reach step n, my last move was either one step from n minus one or two steps from n minus two.”
2. “So the number of ways to reach n is the ways to reach n minus one plus the ways to reach n minus two.”
3. “Base cases: there's one way to reach step one and two ways to reach step two.”
4. “Plain recursion recomputes the same subproblems, so it's exponential. I'll build the answer bottom-up instead.”
5. “I only need the last two values, so I keep two variables and roll them forward from step three up to n.”
6. “This is the same recurrence as the Fibonacci sequence, just shifted by one.”

### Key English phrases for Climbing Stairs

- recurrence relation

  — a formula for an answer in terms of smaller answers

- overlapping subproblems

  — the same smaller question is asked many times

- memoization

  — top-down: cache the result of each subproblem

- bottom-up / tabulation

  — fill answers from the smallest case upwards

- rolling variables

  — keep only the last two results instead of a full table

### How to say the time and space complexity

“Time is O(n), because I compute each step once. Space is O(1), because I only keep two variables. A memoized recursive version would be O(n) time and O(n) space.”

Naming all three versions — naive, memoized, rolling — shows you understand why the optimisation works.

### Communication mistakes on Climbing Stairs

- Mistake: Saying 'it's just Fibonacci' without deriving the recurrence. Instead: Explain the last-move argument first, then mention the Fibonacci connection.
- Mistake: Giving the wrong base cases, for example ways to reach step two equals one. Instead: Say it with the moves: 'step two is either one plus one, or a single two, so two ways.'
- Mistake: Calling the naive recursion 'O(n)'. Instead: Say 'naive recursion is exponential because it repeats subproblems.'

### Likely follow-up questions

- Interviewer: “What if you can climb anywhere from one to k steps at a time?”

  You: “Then ways of n is the sum of the previous k values. A direct loop is O(n times k); keeping a running window sum makes it O(n) time with O(k) space.”

- Interviewer: “What if some steps are broken and you can't land on them?”

  You: “I set the number of ways for a broken step to zero and keep the same recurrence for the others.”

## Common mistakes when explaining Climbing Stairs

- Jumping to the formula without the recurrence story.
- Saying O(n) space when two variables suffice.

## 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 Climbing Stairs?

Fibonacci recurrence, bottom-up, O(1) space.

### Why is Climbing Stairs a dynamic programming problem?

The answer for step n depends on the answers for n−1 and n−2, and naive recursion repeats those subproblems. Storing them removes the repetition.

### What is the space complexity of the optimal Climbing Stairs solution?

O(1): you only need the previous two counts, kept in two variables.

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 — Climbing Stairs, Mockly English (https://app.mocklyenglish.com/mini-apps/explain-climbing-stairs-in-english)".
