Binary Search Implementation | Dataford Interview Questions

How would you implement a binary search algorithm in a way that is easy to maintain and test?

Implement an iterative function that accepts a sorted list of integers and a target integer. Return the index of the target if present, or -1 otherwise. Use clear search boundaries and ensure the function handles empty inputs and targets outside the array range.

Function signature: def binary_search(nums, target):

Constraints

0 <= nums.length <= 10^4
-10^9 <= nums[i] <= 10^9
nums is sorted in non-decreasing order
-10^9 <= target <= 10^9
If the target appears more than once, return any valid index

Function Signature

def binary_search(nums, target):

Your question is Binary Search Implementation. 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

How would you implement a binary search algorithm in a way that is easy to maintain and test?

Function signature: def binary_search(nums, target):

Constraints

0 <= nums.length <= 10^4
-10^9 <= nums[i] <= 10^9
nums is sorted in non-decreasing order
-10^9 <= target <= 10^9
If the target appears more than once, return any valid index

Function Signature

def binary_search(nums, target):

Your question is Binary Search Implementation. 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.