How should I practice Search a Valley Array?

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

Is Search a Valley Array associated with Bloomberg LP?

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

Search a Valley Array

Bloomberg LP● MediumNEW GRADPHONE SCREENONSITE INTERVIEW

Learn

Problem statement

nums contains distinct values, strictly decreasing through one minimum and strictly increasing afterward. Return the index of target, or -1 if absent, in O(log n) time.

Function

searchValley(nums: int[], target: int) → int

Examples

Example 1

nums = [10,4,3,2,5,6,8]target = 3return = 2

3 occurs on the decreasing side before the minimum 2.

Constraints

1 <= nums.length <= 10^5.