How should I practice Parent-Child Deletion Order?

Start by reading the full statement, solve the visible examples, then compare the pattern against related Google onsite interview problems in FastPrep.

Is Parent-Child Deletion Order associated with Google?

FastPrep tags this as a Google onsite interview coding practice problem when the problem catalog has that company and stage context.

Problem · Graph

Parent-Child Deletion Order

● Medium

GoogleFULLTIMEONSITE INTERVIEW

See Google hiring insights

Problem statement

There are n resources numbered from 0 to n - 1. Each row [parent, child] in parentChild means that child must be deleted before parent.

The dependency graph is a directed acyclic graph. A resource may have more than one parent, and disconnected resources are allowed.

The problem statement continues

Pro

Examples

Example 1

n = 5parentChild = [[0,1],[0,2],[2,3],[2,4]]return = [1,3,4,2,0]

Resources 1, 3, and 4 initially have no remaining children. Choosing the smallest available resource at each step yields [1,3,4,2,0].

FastPrep Pro

Reported in 1 Google interview this week

Unlock this recently reported problem

FastPrep Pro gives you full access to interview problems reported within the last week.

Full problem statement and constraints
2 more worked examples, explained
Guided hints and editorial
Run your code on real test cases

$8.25/month

$99 billed yearly — or $19 month-to-month. Cancel anytime.

Free plan — 2 of 2 free unlocks used this week