Practice Reddit Coding Question | Real Coding Interviews | Hack2hire

NewML System Design & SQL tracks just landedSee what's new

Question Bank Pricing Blog Forum

Quick Summary

Construct an organizational hierarchy from a flat list of manager-subordinate pairs.
Identify the top-level manager who never appears as a subordinate.
Traverse the resulting tree using DFS, applying depth-based indentation and alphabetical sorting.

What This Tests

Tree/graph construction from adjacency data
Root node identification in a directed structure
Depth-first search traversal logic
String formatting and efficient accumulation

Common Patterns

Graph Traversal

DFS/BFS

Hashing

Sorting

Test Cases

Input

Output

Expected