Dataford
Popular roles
Software EngineerData AnalystData ScientistData EngineerBusiness AnalystAI EngineerMachine Learning EngineerProduct Manager
Browse
Browse All RolesEvery role hub, from analyst to MLBrowse All CompaniesCompany-specific interview loopsAll Interview GuidesThe full guide library
Top questions by role
Software EngineerData AnalystData ScientistData EngineerBusiness AnalystAI EngineerMachine Learning EngineerProduct Manager
Top questions by skill
SQLPythonStatisticsMachine LearningA/B TestingSystem DesignGenerative AIProduct SenseMetricsBehavioral
Browse all questions →Try a mock interview
ExperiencesCoaching
New
Practice
Mock InterviewsTimed interview simulations with feedbackSuccess PathYour 6-week structured planModulesCurated lessons by topicWebinarsTalks from ex-Big Tech data leadsPlaygroundA free-form scratch editor
Learn
BlogInterview strategy and career adviceTech Job Market ReportHiring trends across data and AI rolesFor UniversitiesDataford for career centersAbout DatafordWho we are and how we build
Pricing
Get started
Efficient Complex Tree Traversal
00:00
5 left

Efficient Complex Tree Traversal

EasyPython

Problem

A company stores nested hiring workflows as a tree. Each node has a name and an ordered list of child nodes. Write a function that traverses the tree efficiently and returns the full path of every node in preorder, where a parent appears before all of its descendants.

The tree may be much deeper than Python's recursion limit, so your implementation must use an explicit stack rather than recursive function calls.

Formal Specification

Input root is a dictionary with the structure {"name": string, "children": list[dict]}. Every child follows the same structure, and the tree contains no cycles. Return a list of strings. Each string joins node names from the root to that node with /.

Child order must be preserved. The input contains at least one node.

Constraints

  • 1 <= number of nodes <= 100,000
  • 1 <= len(node["name"]) <= 100
  • Node names do not contain /
  • The tree contains no cycles
  • Child order must be preserved

Function Signature

def flatten_hierarchy(root):
Interviewer

Whenever you're ready, walk me through your approach or go straight to the code. The requirements are in the Question tab.

You need to log in / sign up to run or submit.
Code
Sign up free to run your codeLog inLn 2
Run your code to see test output here.