#704

Binary Search

easy· Binary Searchruns: 0

Given an array of integers nums sorted in ascending order, and an integer target, return the index of target in nums or -1 if it is not present. The algorithm must run in O(log n) time.

wpm 0acc 100%time 0:000 / 378

class Solution:
    def search(self, nums: list[int], target: int) -> int:
        left, right = 0, len(nums) - 1
        while left <= right:
            mid = (left + right) // 2
            if nums[mid] == target:
                return mid
            if nums[mid] < target:
                left = mid + 1
            else:
                right = mid - 1
        return -1

click the box to focus · tab inserts 4 spaces · backspace to correct · esc to pause

desktop only

codedrill is a typing game and needs a real keyboard. open this on a laptop or desktop to practice.

you can still browse problems and sections from your phone.