← Amazon questions

Maximum Product of Three Ascending Integers

Filed under Amazon

Given an array of integers, find three indices i < j < k such that arr[i] < arr[j] < arr[k] and the product arr[i] * arr[j] * arr[k] is maximized.

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

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