← Amazon questions
CodingMedium

Search in a nearly sorted array with swapped adjacent elements

Filed under Amazon

Given an array of integers which is sorted initially, but where some adjacent elements might have been swapped, find the index of a given target element in O(log N) time.

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.