Search in Sorted Rotated Array II Problem

Search in Sorted Rotated Array II Problem — ExecCode Easy DSA Practice

Solve the Search in Sorted Rotated Array II problem on ExecCode. Free online easy DSA practice in Arrays / Binary Search. Write and run code in Java, C++, Python — no signup required to run.

Problem description

Description You are given the array nums after the rotation and an integer target, return true if target is in nums , or false if it is not in nums . Your task is to there is an integer array nums sorted in non-decreasing order (not necessarily with distinct values). Before being passed to your function, nums is rotated at an unknown pivot index k (0 <= k < nums.length) such that the resulting array is [nums[k], nums[k+1], ..., nums[n-1], nums[0], nums[1], ..., nums[k-1]] (0-indexed). For example, [0,1,2,4,4,4,5,6,6,7] might be rotated at pivot index 5 and become [4,5,6,6,7,0,1,2,4,4]. You must decrease the overall operation steps as much as possible. Return the required answer exactly as shown in the examples.

Examples

Input {"nums": [2, 5, 6, 0, 0, 1, 2], "target": 0}; Output True. Input {"nums": [2, 5, 6, 0, 0, 1, 2], "target": 3}; Output False. Input {"nums": [4, 5, 6, 7, 0], "target": 4}; Output True

Constraints

1 <= nums.length <= 5000 -10^4 <= nums[i] <= 10^4 nums is guaranteed to be rotated at some pivot. -10^4 <= target <= 10^4

Practice Search in Sorted Rotated Array II free on ExecCode. Browse DSA problems, topic map, and placement guides.