← Barclays questions

Maximum Tree Height with Divisor Nodes and Array Partition Maximum Special Sum

Filed under Barclays

Solve two problems: (1) Find the maximum height of a tree where each node branches to children whose values are divisors of the parent node's value. (2) Find the maximum special sum by partitioning an…

You've read your 3 free write-ups

Sign up free to keep reading. Your account opens the first 10 questions of every company.

Related Barclays questions

Collected from public candidate posts and coding forums. Updated Nov 2026.