Dataford
Interview QuestionsInterview GuidesExperiencesMock InterviewsPricing
Get started
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
Experiences
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
Build my plan
Medium Algorithm With Trees or Graphs
00:00
5 left

Medium Algorithm With Trees or Graphs

EasyPython

Problem

Palantir Foundry pipelines may produce datasets that depend on other datasets. Given the dependency relationships among n pipeline stages, return an execution order that satisfies every dependency, or return an empty list if the dependencies contain a cycle.

For each pair [stage, prerequisite], prerequisite must execute before stage. Every stage is identified by an integer from 0 through n - 1. If multiple valid orders exist, return any one of them.

Formal Specification

Implement find_pipeline_order(n, dependencies), where n is an integer and dependencies is a list of integer pairs. Return a list containing every stage exactly once in valid execution order, or [] when no valid order exists.

Constraints

  • 1 <= n <= 10^5
  • 0 <= dependencies.length <= 2 * 10^5
  • Each dependency contains exactly two integers in [0, n - 1].
  • Dependency pairs contain distinct stage IDs.
  • Duplicate dependency pairs may appear.

Function Signature

def find_pipeline_order(n, dependencies):
Interviewer

Your question is Medium Algorithm With Trees or Graphs. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

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