Given sorted_nums = [1, 3, 7, 12, 18, 25, 33, 40, 55, 68, 82], implement O(log n) binary search for
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
Interview Prompt
Given sorted_nums = [1, 3, 7, 12, 18, 25, 33, 40, 55, 68, 82], implement O(log n) binary search for target = 33. Print the index where 33 is found. If not found, print -1.
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