โ† Amazon questions

Search in an array that first increases and then decreases

Filed under Amazon

Given a bitonic array of integers (elements strictly increase to a peak element and then strictly decrease), find the index of a given target element in O(log n) time. Return -1 if not found.

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.