How should I practice Implement Binary Search From Scratch?

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

Is Implement Binary Search From Scratch associated with Cerebras?

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

Implement Binary Search From Scratch

Cerebras● EasyFULLTIMEPHONE SCREEN

Learn

Problem statement

Given an integer array sorted in nondecreasing order and a target, implement iterative binary search from scratch. Return the index of any occurrence of the target, or -1 when it is absent.

Function

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

Examples

Example 1

nums = [-4,-1,0,3,9]target = 3return = 3

The target is at index 3.

Example 2

nums = [1,4,7,11]target = 5return = -1

The target does not occur.

Constraints

0 <= nums.length <= 100000
-10^9 <= nums[i], target <= 10^9
nums is sorted in nondecreasing order.