Given a rotated sorted array of integers that may contain duplicates and a target value, return true if the target exists in the array, otherwise return false. The array was originally sorted in non-decreasing order and then rotated at an unknown pivot. Due to duplicates, the search process may require checking both halves in some cases.
Topics
Companies
Articles
Examples:
N/A
Constraints:
1 = nums.length = 105
-104 = nums[i], target = 10
Companies:
Apple
Topics:
Binary Search
Please log in to access the Submissions tab, where you can review your progress and explore code submissions from other participants.
Please log in to access the Solution tab and view detailed answers and explanations.
Please log in to access the Discussion tab and join conversations with other participants.
Access Restricted: Please Login to access the code editor and test cases.