Medium · Dynamic programming · spoken drill
Free AI LeetCode Communication Coach — Coin Change
DP array dp[a] = min coins to make amount a; try each coin.
The problem
Given coin denominations and an amount, return the fewest coins to make that amount, or -1 if impossible.
Example: coins = [1,2,5], amount = 11 → 3 (5+5+1)
Define dp[a] clearly.
dp = [0] + [float("inf")] * amount
for a in range(1, amount + 1):
for c in coins:
if c <= a:
dp[a] = min(dp[a], dp[a - c] + 1)
return dp[amount] if dp[amount] != float("inf") else -1How 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 …”
- “dp[a] is the min coins for amount a.”
- “Greedy can fail — DP explores all amounts.”
Practise out loud
3 free scored runs left this hour.
Problem · Medium
Given coin denominations and an amount, return the fewest coins to make that amount, or -1 if impossible.
Example: coins = [1,2,5], amount = 11 → 3 (5+5+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 fewest coins that sum to the amount, or minus one if I cannot.
2. Approach
I use DP. dp[a] is the minimum coins for amount a. For each amount I try every coin and take one plus dp of the remainder.
3. Example
With coins 1,2,5 and amount 11, dp builds up to three coins — for example 5+5+1.
4. Time and space
Time is O(amount times number of coins). Space is O(amount).
5. Edge cases
Amount zero returns zero. If no combination works I return minus one.
How to explain Coin Change out loud, step by step
In one sentence: Given some coin values you can use as many times as you like, you have to find the fewest coins that add up to an exact amount, or report that it can't be done.
What to say, in order
- “I return the minimum number of coins, or minus one if the amount can't be made.”
- “My first instinct might be greedy — always take the largest coin — but that fails. With coins 1, 3 and 4 and amount 6, greedy takes 4, 1, 1, which is three coins, but 3 plus 3 is two.”
- “So I'll use dynamic programming. dp of a is the fewest coins needed to make amount a.”
- “dp of zero is zero. Every other entry starts at infinity, meaning 'not reachable yet'.”
- “For each amount from one up to the target, I try every coin that isn't larger than the amount, and take the minimum of dp of amount minus coin, plus one.”
- “At the end, if dp of the target is still infinity, I return minus one; otherwise I return it.”
Key English phrases for Coin Change
- unbounded supply
- — each coin can be used any number of times
- greedy choice
- — always taking the locally best option
- counterexample
- — one input that proves an approach is wrong
- unreachable amount
- — an amount no combination can make
- state / transition
- — what dp[a] means / how you compute it from smaller states
How to say the time and space complexity
“Time is O(amount times the number of coins), because for each amount I try every coin. Space is O(amount) for the DP array.”
Name both inputs. 'O(n)' alone is ambiguous here, because there are two sizes.
Communication mistakes on Coin Change
- Mistake: Starting with greedy and defending it. Instead: Mention greedy only to reject it with a concrete counterexample.
- Mistake: Not saying what dp[a] means. Instead: Define the state in one sentence before the transition.
- Mistake: Forgetting the impossible case until the end. Instead: Say upfront: 'I initialise with infinity and return minus one if it's still infinity.'
Likely follow-up questions
Interviewer: “How would you count the number of ways to make the amount instead?”
You: “dp of zero is one, and I add instead of taking a minimum. To count combinations rather than orderings, I loop over coins in the outer loop and amounts in the inner loop.”
Interviewer: “How would you return which coins were used?”
You: “Alongside dp, I store the coin that gave the best value for each amount. Then I walk back from the target, subtracting that coin each time until I reach zero.”
Common mistakes when explaining Coin Change
- Greedy “always take largest coin” without saying when it fails.
- Off-by-one on initializing dp with infinity.
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