Demonstrate O(1) set membership vs O(n) list search
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
Demonstrate O(1) set membership vs O(n) list search. Create data_list = list(range(100000)) and data_set = set(range(100000)). Check if 99999 is in each. Print both results and print 'Set lookup is O(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