Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

Day 203 #419

Closed
vaskoz opened this issue Mar 13, 2019 · 0 comments
Closed

Day 203 #419

vaskoz opened this issue Mar 13, 2019 · 0 comments
Assignees
@vaskoz

Comments

@vaskoz
Copy link
Owner

vaskoz commented Mar 13, 2019

Good morning! Here's your coding interview problem for today.

This problem was asked by Uber.

Suppose an array sorted in ascending order is rotated at some pivot unknown to you beforehand. Find the minimum element in O(log N) time. You may assume the array does not contain duplicates.

For example, given [5, 7, 10, 3, 4], return 3.
@vaskoz vaskoz self-assigned this Mar 13, 2019
@vaskoz vaskoz mentioned this issue Mar 13, 2019
Merged
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees

@vaskoz vaskoz

Labels
None yet
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
1 participant
@vaskoz