Coding Exercises for QA | Dataford Interview Questions

Write a method for a binary search using recursion.

Implement binary_search(nums, target) for an ascending sorted list of integers. Return the index of target if it exists, or -1 otherwise. The search must narrow the range recursively rather than scanning the array or using a built-in search function.

Input is a list of integers and an integer target. The output is an integer index.

Constraints

0 <= len(nums) <= 10^5
-10^9 <= nums[i] <= 10^9
nums is sorted in ascending order
Return any valid index if duplicate target values are present

Function Signature

def binary_search(nums, target):

Your question is Coding Exercises for QA. 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

Write a method for a binary search using recursion.

Input is a list of integers and an integer target. The output is an integer index.

Constraints

0 <= len(nums) <= 10^5
-10^9 <= nums[i] <= 10^9
nums is sorted in ascending order
Return any valid index if duplicate target values are present

Function Signature

def binary_search(nums, target):

Your question is Coding Exercises for QA. 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.