DIFF.BLOG
New
Following
Discover
Jobs
More
Suggest a blog
Upvotes plugin
Report bug
Contact
About
Sign up  
[LeetCode] Fixed Point
1
·
·
Feb. 22, 2022, 8:47 a.m.
Summary
1064. Fixed Point Given an array of distinct integers arr, where arr is sorted in ascending order, return the smallest index i that satisfies arr[i] == i. If there is no such index, return -1. ...
Read full post on songhayoung.github.io →
Submit
AUTHOR
RECENT POSTS FROM THE AUTHOR