How should I practice Nodes at a Given N-ary Tree Level?

Start by reading the full statement, solve the visible examples, then compare the pattern against related Amazon phone screen problems in FastPrep.

Is Nodes at a Given N-ary Tree Level associated with Amazon?

FastPrep tags this as a Amazon phone screen coding practice problem when the problem catalog has that company and stage context.

Problem · Tree

Nodes at a Given N-ary Tree Level

● Easy

AmazonFULLTIMEPHONE SCREEN

See Amazon hiring insights

Problem statement

An N-ary tree uses node IDs from 0 through children.length - 1, with root ID 0. For each node ID, children[id] lists its child IDs from left to right.

The problem statement continues

Pro

Examples

Example 1

children = [[1,2,3],[4,5],[],[],[],[]]level = 2return = [4,5]

Only nodes 4 and 5 are two edges from the root.

FastPrep Pro

Reported in 1 Amazon 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