← Amazon questions

Search in array with pattern constraint

Filed under Amazon

Given an array where each element satisfies |a[i] - a[i+1]| <= M, find the index of a target value in O(k) time where k is the distance from the start, or better than O(n).

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.