Binary Search: coding question

Problem

You get an array of integers nums and an integer target. The items of nums are in ascending order, and no two items are equal.

Return the index of target in nums. If target is not in nums, return -1. Your solution must run in O(log n) time.

SysRound wrote this statement. A reference solution checks every example.

Continue with questions that share topics or the same question type.

Binary Searchable Numbers in an Unsorted Array
Coding · Array · Binary Search · Monotonic Stack
Search a 2D Matrix
Coding · Array · Binary Search · Matrix
Search a 2D Matrix II
Coding · Array · Binary Search · Divide and Conquer
Search in Rotated Sorted Array
Coding · Array · Binary Search

Sources · 2 references

These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.

Hello Interview · 4 records

Problem

You get an array of integers nums and an integer target. The items of nums are in ascending order, and no two items are equal.

Return the index of target in nums. If target is not in nums, return -1. Your solution must run in O(log n) time.

SysRound wrote this statement. A reference solution checks every example.