Quick Overview

This question evaluates skill in reconstructing hierarchical relationships from unordered span records, testing understanding of tree structure assembly, orphan/root detection, and ordering children by timestamp within the Coding & Algorithms domain.

Build span trees from unordered trace spans

Company: Datadog

Role: Software Engineer

Category: Coding & Algorithms

Difficulty: medium

Interview Round: Technical Screen

Overview: This question evaluates skill in reconstructing hierarchical relationships from unordered span records, testing understanding of tree structure assembly, orphan/root detection, and ordering children by timestamp within the Coding & Algorithms domain.

Loading…