The Triplet Hunt
A medium Python mock interview question on DataDriven. Practice with AI-powered feedback, real code execution, and a hire/no-hire decision.
- Domain
- Python
- Difficulty
- medium
- Seniority
- L5
Interview Prompt
You are reconciling a ledger: `nums` is a list of integer adjustments and `k` is a target balance. Return every unique trio of values that together sum to `k`, each trio listed from its smallest value to its largest. The same three values never appear twice, and the trios come back in ascending order.
Summary
Every path that works gets a seat at the table.
How This Interview Works
- Read the vague prompt (just like a real interview)
- Ask clarifying questions to the AI interviewer
- Write your python solution with real code execution
- Get instant feedback and a hire/no-hire decision