Coding

2 Coding Questions Related to Tree , Graph and apply DP for that

Asked at

Nutanix

1Give yourself 5 minutes

2Answer out loud, not in your head

3Then compare with the answer below

Stuck? Show a way to structure it+

01State that no concrete input-output problem is provided.
02Ask for constraints, graph properties, and objective.
03Identify likely families such as tree DP or DAG DP only after clarification.
04Explain how the chosen state would follow from the clarified objective.

Reference answer

This record is a candidate-reported topic, not a defined coding problem, so there is no single correct algorithm to present. Start by asking whether the graph is a tree, DAG, or general graph; what must be optimized or counted; whether nodes may be revisited; and the input limits. For a tree, a common pattern is DP states returned from children. For a DAG, topological order often supports DP. For a general graph, cycles may make naive DP invalid. The right answer demonstrates disciplined clarification rather than inventing an unseen prompt.

Complexity: After the two tasks are specified, a tree or graph traversal is O(V + E) time and O(V) space; a DP must state its number of states and transitions separately.

Then expect these follow-ups

What questions would you ask first?
Tests: requirements gathering
Give a tree-DP example once the objective is maximum independent set.
Tests: state design

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