EasyBinary Search· 63% acceptance
#691

Binary Search 1

Easy

Search `target` in sorted ascending `nums`. Return index or `-1`. Variant **#1**.

Example 1

Input: nums = [1,3,5,7,9,11,13,15,17], target = 7

Output: 3

Constraints

  • 1 <= nums.length <= 10^4
  • nums is sorted in ascending order

Acceptance: 63% · Topics: binary-search, array

search

← All practice problems