🟩 Binary Search (#704)

🔗 Problem Link

• Leetcode 704: Binary Search
• Neetcode: Binary Search

📋 Problem Statement

Given a sorted (in ascending order) integer array nums of n elements and a target value, write a function to search for target in nums. If target exists, then return its index. Otherwise, return -1.

You must write an algorithm with O(log n) runtime complexity.