Available question text
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.
Related questions
Continue with questions that share topics or the same question type.
- Suppose an array sorted in ascending order is rotated at some pivot unknown to you beforehand (e.g., [4,5,6,7,0,1,2]). Search for a target value and return its index, or -1 if not found. Required time complexity: O(log n).
Coding
- Convert Sorted Array to Binary Search Tree
Coding
- Phone Screen: Two classic leetcode problems in the Top 30 list. One tests binary search in a sorted array, another one tests graph search using Breath First Search or Depth First Search algorithm
Coding
- Search in Rotated Sorted Array
Coding · Array · Binary Search
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
Amazon
Leetcode 702. Search in a Sorted Array of Unknown Size
Reported Jun 3, 2026 · 1 source report
SENIOR
Source snapshot: Nov 12, 2026
View source