Given an array where every adjacent elements are differ by at most 1. Given such array find an element. Algorithm should avoid linear search.
asked 03 Oct, 23:24
Gautam Goswami 9●2 accept rate: 0%
Could you give some examples?
answered 04 Oct, 02:41
watermelonlh 11●1 accept rate: 0%
Once you sign in you will be able to subscribe for any updates here
Answers
Answers and Comments
Markdown Basics
learn more about Markdown
All LeetCoders,
Welcome to the LeetCode community!
Discuss your thoughts and ideas on coding questions.
Any question about the site itself should be posted at Meta LeetCode instead.
» read faq
Code. Read. Discuss.
Tags:
search ×4 array ×2
Asked: 03 Oct, 23:24
Seen: 45 times
Last updated: 04 Oct, 02:41
Local Minimum
Recover binary search Tree - What's wrong with my code
gas station problem
Problem: Candy (Any comments or better solutions? Thanks)