Medium · Sliding window · spoken drill
Free AI LeetCode Communication Coach — Longest Substring Without Repeating Characters
Grow a window; when a duplicate appears, move the left edge past its last index.
The problem
Given a string s, find the length of the longest substring without repeating characters.
Example: s = "abcabcbb" → 3 (abc)
Name left, right, and the last-seen map.
last = {}
left = 0
best = 0
for right, ch in enumerate(s):
if ch in last and last[ch] >= left:
left = last[ch] + 1
last[ch] = right
best = max(best, right - left + 1)
return bestHow 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 grow a window until a character repeats.”
- “Then I move the left edge forward.”
Practise out loud
3 free scored runs left this hour.
Problem · Medium
Given a string s, find the length of the longest substring without repeating characters.
Example: s = "abcabcbb" → 3 (abc)
- 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 length of the longest stretch of characters with no repeats.
2. Approach
I will use a sliding window and a map of the last index of each character. When I see a repeat inside the window, I move left past it.
3. Example
On abcabcbb, the window grows to abc length 3, then repeats force left forward. The max stays 3.
4. Time and space
Time is O(n). Space is O(alphabet size) for the map.
5. Edge cases
I would check empty input and a string of all the same letter.
How to explain Longest Substring Without Repeating Characters out loud, step by step
In one sentence: You have to find the length of the longest stretch of consecutive characters in a string where no character appears twice.
What to say, in order
- “I'm looking for a contiguous substring, not a subsequence, and I return its length.”
- “I'll keep a sliding window with a left edge and a right edge, and the window always contains unique characters.”
- “I also keep a map from each character to the last index where I saw it.”
- “I move the right edge one step at a time. If the new character was last seen inside the current window, I jump the left edge to one past that index.”
- “I use the maximum of the current left and that position, so the left edge never moves backwards.”
- “Then I update the character's last index and record the window length, right minus left plus one, if it's the best so far.”
Key English phrases for Longest Substring Without Repeating Characters
- contiguous
- — the characters must be next to each other
- sliding window
- — a range [left, right] that grows on the right and shrinks on the left
- last-seen index
- — where a character most recently appeared
- the window is valid
- — it currently has no repeated characters
- the left edge never moves backwards
- — why you take the maximum when you jump
How to say the time and space complexity
“Time is O(n), because the right edge visits each character once and the left edge only moves forward. Space is O(min of n and the alphabet size), because the map holds at most one entry per distinct character.”
Say 'the left edge only moves forward' — that sentence is the proof that the window is linear, not quadratic.
Communication mistakes on Longest Substring Without Repeating Characters
- Mistake: Mixing up 'substring' and 'subsequence'. Instead: Say 'substring — the characters have to be consecutive.'
- Mistake: Saying 'when I see a repeat I restart the window' without saying where. Instead: Say exactly where the left edge goes: 'one past the previous index of that character.'
- Mistake: Calling it O(n squared) because there are two pointers. Instead: Explain that both pointers only move forward, so together they make at most 2n steps.
Likely follow-up questions
Interviewer: “How would you return the substring itself, not just the length?”
You: “Whenever I update the best length, I also store the current left index. At the end I slice from that start for the best length.”
Interviewer: “What if the window may contain at most k distinct characters instead?”
You: “I'd keep a count map for the window. When it has more than k distinct keys, I shrink from the left, decrementing counts and removing keys that hit zero. It's still O(n).”
Common mistakes when explaining Longest Substring Without Repeating Characters
- Saying “sliding window” without moving left on a duplicate.
- Returning the substring when the question asks for length.
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.
Easy · Stack
Valid Parentheses
Stack story: push openers, pop on matching closer, empty stack at the end.
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