Optimized Array Search | Dataford Interview Questions

Write a program to search for a specific value in an array. If the array is sorted, how would you optimize this search, and how would you implement it without using helper parameters?

Implement search_value(nums, target, is_sorted). Return the index of one matching value, or -1 if the value is absent. When is_sorted is true, use iterative binary search with local bounds rather than recursive helper parameters.

Constraints

0 <= nums.length <= 10^5
-10^9 <= nums[i] <= 10^9
-10^9 <= target <= 10^9
When is_sorted is true, nums is sorted in nondecreasing order
Return any valid index if duplicate target values exist

Function Signature

def search_value(nums, target, is_sorted):

Your question is Optimized Array Search. 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 program to search for a specific value in an array. If the array is sorted, how would you optimize this search, and how would you implement it without using helper parameters?

Constraints

0 <= nums.length <= 10^5
-10^9 <= nums[i] <= 10^9
-10^9 <= target <= 10^9
When is_sorted is true, nums is sorted in nondecreasing order
Return any valid index if duplicate target values exist

Function Signature

def search_value(nums, target, is_sorted):

Your question is Optimized Array Search. 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.