Atlassian interview question
Search an element from a rotated sorted array. Complexity must be lesser than O(n)
Interview Answer
Anonymous
4 Sept 2018
Find the rotation point using binary search and split into two sorted arrays. Apply binary search in both arrays
4