Binary Search With Duplicates | Dataford Interview Questions

Implement a standard binary search to find the first or last occurrence of a target element in a sorted array with duplicates.

Write find_occurrence(nums, target, find_first), where find_first determines whether to return the first or last matching index. Return -1 if the target does not occur; the input array may be empty.

Constraints

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

Function Signature

def find_occurrence(nums, target, find_first):

Your question is Binary Search With Duplicates. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

Problem

Implement a standard binary search to find the first or last occurrence of a target element in a sorted array with duplicates.

Constraints

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

Function Signature

def find_occurrence(nums, target, find_first):

Your question is Binary Search With Duplicates. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.