How should I practice Search in a Bitonic Array?

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 a Bitonic Array 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 a Bitonic Array

Bloomberg LP● MediumNEW GRADPHONE SCREEN

Learn

Problem statement

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

Function

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

Examples

Example 1

nums = [1,3,10,14,16,7,6,2]target = 3return = 1

3 occurs on the increasing side.

Constraints

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