Binary Search Problem

Binary Search Problem — ExecCode Easy DSA Practice

Solve the Binary Search problem on ExecCode. Free online easy DSA practice in Binary Search. Write and run code in Java, C++, Python — no signup required to run.

Problem description

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

Examples

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

Constraints

1 ≤ nums.length ≤ 10⁴ -10⁴ ≤ nums[i] ≤ 10⁴ All integers in nums are unique nums is sorted in ascending order -10⁴ ≤ target ≤ 10⁴

Practice Binary Search free on ExecCode. Browse DSA problems, topic map, and placement guides.