Easy · Dynamic programming · spoken drill
Free AI LeetCode Communication Coach — Climbing Stairs
Bottom-up Fibonacci: each step comes from one or two stairs below.
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 bHow 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)
- 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
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
- “To reach step n, my last move was either one step from n minus one or two steps from n minus two.”
- “So the number of ways to reach n is the ways to reach n minus one plus the ways to reach n minus two.”
- “Base cases: there's one way to reach step one and two ways to reach step two.”
- “Plain recursion recomputes the same subproblems, so it's exponential. I'll build the answer bottom-up instead.”
- “I only need the last two values, so I keep two variables and roll them forward from step three up to n.”
- “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
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