Ternary Search
Implement ternary search to locate the maximum of a discrete unimodal function.
Find Minimum in Rotated Sorted Array
Implement a function that finds the minimum element in a rotated sorted array of distinct integers in O(log n) time.
Find in Mountain Array
Implement a function to search for a target value in a mountain array using binary search.
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.
Upper Bound Binary Search
Write a function that returns the index of the first element greater than a target in a sorted list.
Rotated Array Search II
Implement a function to search for a target in a rotated sorted array with possible duplicates.
First Bad Version
Implement a function to find the first bad version in a sorted range using binary search.
Book Allocation: Minimize Maximum Pages
Implement a function that returns the minimized maximum pages when allocating a list of books to k students.
Showing 1–8 of 8 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.