Leetcode 702. Search in a Sorted Array of Unknown Size

Given a sorted ascending array with unknown length accessible only via a bounded reader (out‑of‑range returns a sentinel), find the index of a target or return -1. The key is to quickly locate an interval containing the target (e.g., by exponential/backoff probing) and then run binary search to achieve logarithmic time.