First 1 in Sorted Binary Array | Dataford Interview Questions

Find the first occurrence of 1 in a sorted array of 0s and 1s; then solve it in one iteration.

Asked in the Technical Round 1 stage. Standard binary search was discussed first, followed by the one-iteration solution.

Input and Output

Implement find_first_one(nums), where nums is a non-empty sorted list containing only 0 and 1. Return the zero-based index of the first 1, or -1 if the array contains no 1.

Constraints

1 <= len(nums) <= 1000
nums[i] is either 0 or 1
nums is sorted in nondecreasing order

Function Signature

def find_first_one(nums):

Your question is First 1 in Sorted Binary Array. 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