MediumCoding

Given a list of Nodes, each with a unique string id and a list of subnodes it depends on, find the maximum depth of the dependencies.

Asked at

Amazon

1Give yourself 5 minutes

2Answer out loud, not in your head

3Then compare with the answer below

Reference answer

To determine the maximum dependency depth, model the nodes and their relationships as a directed graph. Then, employ a Depth-First Search (DFS) algorithm. For each node, recursively explore its dependencies, incrementing the depth with each level. Maintain a global maximum to track the deepest path found across all starting nodes. Memoization or dynamic programming can optimize this by storing the computed depth for each node to avoid redundant calculations.

Free to read · better with Enzo

Practice this out loud with Enzo

Enzo runs it as a mock interview, pushes back with follow-ups, and grades you on the rubric.

Continue with Enzo Sign up free

Next question

Calculate the trapped rainwater between bars in a given array.
Find a triplet in an array with a given sum.
Print all combinations of numbers from 1 to n that sum to n.
Find the number of rotations in a circularly sorted array.
Find all permutations of a given string.
Check if two given binary trees are identical.