It looks like the array is sorted. If it is sorted, then the following should be optimal:
Binary search for the left insertion point, and then for the right insertion point.
If found, then that's the answer.
Otherwise, check the left or right number and see which one is closer to the target.
target
Time complexity: O(log n)
Are you sure you want to hide this comment? It will become hidden in your post, but will still be visible via the comment's permalink.
Hide child comments as well
Confirm
For further actions, you may consider blocking this person and/or reporting abuse
We're a place where coders share, stay up-to-date and grow their careers.
It looks like the array is sorted. If it is sorted, then the following should be optimal:
Binary search for the left insertion point, and then for the right insertion point.
If found, then that's the answer.
Otherwise, check the left or right number and see which one is closer to the
target.Time complexity: O(log n)