Live Batches
Masterclasses
Menu
Free Courses
Account
Login / Sign Up
Problem Submissions Solution

Search in Rotated Array II

Difficulty: Easy

Acceptance: 79.00%

Points: 20.00

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
Locked Content
Access Restricted: Please Login to access the code editor and test cases.