Roots and Branches
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
A storage indexer hands you object keys as slash-separated `paths`, and you need them folded into a nested dict that mirrors the directory layout: every directory segment maps to an inner dict and every file (the final segment) maps to `None`. Paths that share a leading directory must collapse onto the same node instead of clobbering each other, and an empty list yields an empty dict.
Summary
Flat strings carry a hierarchy. Recover it.
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