Leetcode 1064. Fixed Point

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.