How should I practice Search in Rotated Sorted Array II?

Start by reading the full statement, solve the visible examples, then compare the pattern against related Bloomberg LP phone screen problems in FastPrep.

Is Search in Rotated Sorted Array II associated with Bloomberg LP?

FastPrep tags this as a Bloomberg LP phone screen coding practice problem when the problem catalog has that company and stage context.

Search in Rotated Sorted Array II

Bloomberg LP● MediumNEW GRADPHONE SCREEN

Learn

Problem statement

An integer array was sorted in nondecreasing order and then rotated at an unknown position. The array may contain duplicates.

Given nums and target, return whether target occurs in nums.

Function

search(nums: int[], target: int) → boolean

Examples

Example 1

nums = [2,5,6,0,0,1,2]target = 0return = true

Zero occurs at the rotation boundary.

Example 2

nums = [2,5,6,0,0,1,2]target = 3return = false

Three is absent.

Constraints

1 <= nums.length <= 10^5.
All values and target are signed 32-bit integers.