Easy · Stack · spoken drill
Free AI LeetCode Communication Coach — Valid Parentheses
Stack story: push openers, pop on matching closer, empty stack at the end.
The problem
Given a string of '(', ')', '{', '}', '[' and ']', determine if brackets close in the correct order.
Example: s = "{[]}" → true
Push, pop, empty check.
pairs = {")": "(", "]": "[", "}": "{"}
stack = []
for ch in s:
if ch in "([{":
stack.append(ch)
elif not stack or stack.pop() != pairs[ch]:
return False
return not stackHow 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 will use a stack.”
- “I push openers and pop when a closer matches.”
- “At the end the stack must be empty.”
Practise out loud
3 free scored runs left this hour.
Problem · Easy
Given a string of '(', ')', '{', '}', '[' and ']', determine if brackets close in the correct order.
Example: s = "{[]}" → true
- 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 have a string of brackets and I need every closer to match the right opener in order.
2. Approach
I will use a stack. I push opening brackets. When I see a closer I pop and check it matches. If the stack is empty when I pop, it is invalid.
3. Example
On '{[]}' I push curly, push square, the square closer matches, the curly closer matches, and the stack is empty — valid.
4. Time and space
Time is O(n). Space is O(n) in the worst case of all openers.
5. Edge cases
Empty string is valid. A leftover opener at the end is invalid.
How to explain Valid Parentheses out loud, step by step
In one sentence: You get a string made only of round, square and curly brackets and have to say whether every bracket is closed by the right type in the right order.
What to say, in order
- “The rule is that the most recent unclosed bracket has to be closed first, which is last-in, first-out — so I'll use a stack.”
- “I keep a small map from each closing bracket to its matching opening bracket.”
- “I scan the string. When I see an opening bracket, I push it.”
- “When I see a closing bracket, the stack must not be empty, and the top must be its matching opener. If either check fails, I return false; otherwise I pop.”
- “After the loop, the string is valid only if the stack is empty, because leftover openers were never closed.”
- “A quick shortcut: if the length is odd, I can return false immediately.”
Key English phrases for Valid Parentheses
- opening / closing bracket
- — use 'bracket' or name them: parenthesis, square bracket, curly brace
- last in, first out
- — why a stack fits this problem
- push / pop / peek at the top
- — the three stack operations you narrate
- a matching pair
- — an opener and closer of the same type
- unclosed
- — an opener still left on the stack at the end
How to say the time and space complexity
“Time is O(n), because I process each character once and each push and pop is constant time. Space is O(n) in the worst case, when the string is all opening brackets and they all stay on the stack.”
Give the worst case for space explicitly — it shows you know when the stack actually grows.
Communication mistakes on Valid Parentheses
- Mistake: Using 'parentheses' for all three bracket types and confusing the listener. Instead: Say 'brackets' in general and name the type when it matters: 'a closing square bracket.'
- Mistake: Forgetting to say what happens when a closer arrives and the stack is empty. Instead: Say 'If the stack is empty when I see a closer, I return false.'
- Mistake: Ending with 'and then it works' instead of the final empty-stack check. Instead: Close the loop out loud: 'At the end I return whether the stack is empty.'
- Mistake: Suggesting a counter for each type as the full solution. Instead: Counters miss ordering: '([)]' has balanced counts but is invalid. Say that as your reason for the stack.
Likely follow-up questions
Interviewer: “What if there's only one type of bracket?”
You: “Then I don't need a stack. I keep a counter: plus one for an opener, minus one for a closer, fail if it goes negative, and require zero at the end. That's O(1) space.”
Interviewer: “How would you report where the string first becomes invalid?”
You: “I'd push indices instead of characters. A bad closer gives me its own index; if the scan ends with items left, the index at the bottom of the stack is the first unmatched opener.”
Common mistakes when explaining Valid Parentheses
- Forgetting the leftover-opener case.
- Not saying what happens when you pop an empty stack.
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.
Medium · Stack
Daily Temperatures
Monotonic stack of indices waiting for a warmer day; answer[i] is days to wait.
FAQ
Questions
More questions? Email us at contact@mocklyenglish.com.
Course: How to explain a LeetCode solution · Think out loud · Explain code out loud
Quick answer
Free AI LeetCode Communication Coach: restate, name the approach, walk an example, state time and space, then name an edge case. Record 60–90 seconds and get a scorecard on that structure — not on your accent.
Related in this path
People like you
Practise in the course
Think out loud in English