Skip to content

problem1.md

Latest commit

 

History

History
13 lines (10 loc) · 481 Bytes

problem1.md

File metadata and controls

13 lines (10 loc) · 481 Bytes

Problem 1: Half-Interval Search

Problem Statement

Given an array of integers nums which is sorted in ascending order, and an integer target, write a function to search target in nums. If target exists, then return its index. Otherwise, return -1. You must write an algorithm with O(log n) runtime complexity.

Input Format

  • A sorted array of integers nums.
  • An integer target.

Example

Input: nums = [-1, 0, 3, 5, 9, 12], target = 9
Output: 4