EasyBinary Search· 65% acceptance
#693

Binary Search 3

Easy

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

Example 1

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

Output: 9

Constraints

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

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

search

← All practice problems