Compute sums and max path in N-ary tree

Q: How do I practice coding and algorithm questions?

Use PracHub's coding console to write, test, and debug your solutions in Python or JavaScript. View hints, test against sample inputs, and compare with official solutions.

Q: What difficulty level is this coding question?

This is a medium difficulty Coding & Algorithms question, commonly asked during Technical Screen rounds at Uber.

Q: What role is this question designed for?

This question is commonly asked for Software Engineer candidates at Uber during technical interviews.

Question

Compute sums and max path in N-ary tree

PracHub · Accepted Answer

This question evaluates implementation and traversal skills for N-ary tree data structures, including recursion/DFS techniques, aggregation of node values, and tracking root-to-leaf path sums.

Quick Overview

Compute sums and max path in N-ary tree