Hiring process8 levels
  1. 1 IQ Test
  2. 2 Additional Online Test (If Required)
  3. 3 Office Interview with Hiring Manager
  4. 4 Unpaid Test Task (Motivation Check)
  5. 5 Paid Test Task and Follow-Up Interview
  6. 6 Iterative Paid Test Tasks
  7. 7 Office Verification
  8. 8 Final Interview with the Founder

Problems > Largest Proper Subtree > Editorial

Largest Proper Subtree — Solution & Editorial

Back to the Problem

Compute subtree sizes bottom-up (post-order over a BFS order works iteratively) and take the maximum over non-root nodes.

Complexity: O(N)