Available question text
Given a sorted (strictly increasing) integer array, find an index i such that A[i] == i and return it (or -1 if none). Use the monotonic property of A[i]-i to guide a binary search for O(log n) time.
Related questions
Continue with questions that share topics or the same question type.
- Best Meeting Point
Coding
- Check if Point Is Reachable
Coding
- Count Number of Rectangles Containing Each Point
Coding
- Count Subarrays With Fixed Bounds
Coding · Array · Monotonic Queue · Queue
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
No company association
Leetcode 1064. Fixed Point
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source