How do I approach Coding & Algorithms interview questions?

Coding & Algorithms questions require understanding of core concepts and practice. PracHub provides solutions with explanations to help you master coding & algorithms interviews.

What difficulty level is this interview question?

This is a Medium difficulty Coding & Algorithms question, commonly asked during Onsite rounds at DoorDash.

What role is this question designed for?

This question is commonly asked for Software Engineer candidates at DoorDash during technical interviews.

Solve tree distance and design file system

Last updated: Mar 29, 2026

Quick Overview

This question evaluates a candidate's ability to compute distances within tree structures and to design efficient hierarchical data structures supporting dynamic queries and updates, testing skills in tree algorithms and data structure design within the Coding & Algorithms domain.

Medium
DoorDash
Coding & Algorithms
Software Engineer

DoorDash

Aug 4, 2025, 10:55 AM

Software Engineer

Onsite

Coding & Algorithms

Question

Given a binary tree, find the maximum distance between two 'alive' nodes, where 'alive' nodes are initially the leaves; follow-up: allow the set of 'alive' nodes to be specified arbitrarily. LeetCode 1166. Design File System

https://leetcode.com/problems/design-file-system/description/

Comments (0)

Loading comments...

Browse More Questions

More Coding & Algorithms•More DoorDash•More Software Engineer•DoorDash Software Engineer•DoorDash Coding & Algorithms•Software Engineer Coding & Algorithms