← Microsoft questions

Array Index Pair Maximization and Binary Tree Leaf Sum Product

Filed under Microsoft

Given an array of integers, find the maximum value of (j - i) such that arr[j] > arr[i]. Also, given a binary tree, calculate the product of the sums of leaf node values at each level.

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 Microsoft questions

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