← Paytm questions

Optimized Search in Array with Inserted -1 Values

Filed under Paytm

Given a sorted array of positive numbers where -1 may be inserted between elements (between 0 and 2 times), search for a given target key in O(log n) time. Return the index of the key if 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 Paytm questions

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