How should I practice Leftmost Binary Search Match?

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

Is Leftmost Binary Search Match associated with ByteDance?

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

Problem · Array

Leftmost Binary Search Match

Learn this problem

● Easy

ByteDanceFULLTIMEPHONE SCREEN

Problem statement

Return the smallest index whose value equals target in the nondecreasing array nums, or -1 when the target is absent.

Function

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

Examples

Example 1

nums = [1,2,2,2,4]target = 2return = 1

The first of three equal values is at index one.

Example 2

nums = [1,3,5]target = 2return = -1

The lower-bound position does not contain the target.

Constraints

0 <= nums.length <= 100000
nums is sorted in nondecreasing order.
The required time complexity is O(log n).