4. Binary Search

Easy

Topics

Hint

Understand Before Coding

Visualize This Problem

Open Visualizer

Draw Your Approach

Draw

Example 1:

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

Output: 4

Explanation: The target 9 is found at index 4 in the array.

Example 2:

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

Output: -1

Explanation: The target 2 is not found in the array, so -1 is returned.

Example 3:

Input: nums = [2,5], target = 5

Output: 1

Explanation: The target 5 is found at index 1.

Example 4:

Input: nums = [5], target = 5

Output: 0

Explanation: The target 5 is found at index 0.

Example 5:

Input: nums = [2,5], target = 0

Output: -1

Explanation: The target 0 is not in the array.

Constraints:

•
•
•
•

Time Complexity

O(log n)

Space Complexity

O(1)

4. Binary Search

Understand Before Coding

Visualize This Problem

Draw Your Approach

Example 1:

Example 2:

Example 3:

Example 4:

Example 5:

Constraints:

Learn

Topics

Hint

Use Cases

4. Binary Search

Understand Before Coding

Visualize This Problem

Draw Your Approach

Example 1:

Example 2:

Example 3:

Example 4:

Example 5:

Constraints:

Learn

Topics

Hint

Use Cases