← FactSet questions

Find missing number in an AP in O(logN) time

Filed under FactSet

Given a sorted array representing an arithmetic progression (AP) with one missing element, find the missing number in O(log N) time complexity.

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

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