The Tail Finder
A medium Python mock interview question on DataDriven, with an AI interviewer who asks follow-up questions and a hire or no-hire decision at the end.
- Domain
- Python
- Difficulty
- medium
- Seniority
- L3
Interview Prompt
A linked list's node values arrive in `lst`, ordered head to tail. Recursively find the value stored at the final node.
Summary
Navigate to the end of a linked list using recursion.
How This Interview Works
- Read the vague prompt (just like a real interview)
- Ask clarifying questions to the AI interviewer
- Write and run your Python against test cases
- Answer the interviewer's follow-up questions, then get a hire or no-hire decision