Search in Rotated Array
Implement an efficient search in a rotated sorted array using modified binary search.
Median of Sorted Array BS
Implement a binary search algorithm to find the median of two sorted arrays efficiently.
Kth Missing Positive
Given a strictly increasing array and an integer k, return the k-th positive integer that is missing from the array.
Find in Mountain Array
Implement a function to search for a target value in a mountain array using binary search.
Maximum Running Time of n Computers
Use binary search to maximize the running time for n computers with batteries.
Binary Search on Answer: Find the Minimal Maximum Subarray Sum
Implement a function that finds the minimal possible maximum subarray sum when splitting an array into at most k contiguous subarrays.
Lower Bound Binary Search
Implement binary search to find the first index where an element is not less than a given target.
Upper Bound Binary Search
Write a function that returns the index of the first element greater than a target in a sorted list.
Search 2D Matrix
Given a sorted 2D matrix with sorted rows and first element of each row greater than last of previous, find target efficiently.
First Bad Version
Implement a function to find the first bad version in a sorted range using binary search.
Showing 1–10 of 10 challenges · Binary Search
Binary Search — Python coding challenges
What you will find here
This page lists binary search challenges — real Python problems you solve in the browser IDE with instant test feedback. Each challenge includes a clear brief, starter code, and automated checks.
Challenges vs tutorials and quizzes
Challenges test what you can build under constraints. For guided teaching, use our Python tutorials. For quick checks, try quizzes or copy snippets from code samples.