← Amazon questions

Optimize max sum triplet with constraints

Filed under Amazon

Given two arrays A and B of size n, find the maximum sum of A[i] + A[j] + A[k] such that the corresponding values in B are different for each of the three indices (i.e., B[i] != B[j], B[j] != B[k]…

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.