You don't need to be smooth. You need to cover four beats, in order:
- Repeat it back. "So I'm given an array and I need to return the two numbers that add up to the target."
- Name the brute force. "The simplest version is checking every pair - that's O(n²)."
- Improve it. "I can do better with a hash map: for each number, check if the complement is already stored. That's O(n)."
- Narrate as you code. Say what each line is doing and why, especially the tricky parts.