Design an Iterative Path Tree and Clarify File Lookup Semantics

Read the full interview experience this question came from →

Quick Overview

Design a component-based tree for unique absolute paths and traverse it with an explicit stack. The discussion covers repeated directory names, long paths, full-path reconstruction, implicit parents, memory tradeoffs, and how to handle an inconsistent example and missing file-search contract.

Design an Iterative Path Tree and Clarify File Lookup Semantics

Company: Uber

Role: Software Engineer

Category: Software Engineering Fundamentals

Difficulty: medium

Interview Round: Technical Screen

Overview: Design a component-based tree for unique absolute paths and traverse it with an explicit stack. The discussion covers repeated directory names, long paths, full-path reconstruction, implicit parents, memory tradeoffs, and how to handle an inconsistent example and missing file-search contract.

Read the full Uber Software Engineer interview experience this question came from

Uber logo
Uber
Sep 4, 2026
mediumSoftware EngineerTechnical ScreenSoftware Engineering Fundamentals
6
0
Loading...