Binary-search

Level: Intermediate

1. Write a function to search for a target value in a matrix where each row and column are sorted using Binary Search.
2. Implement a function to find the smallest divisor such that the sum of the division results is less than or equal to a threshold using Binary Search.
3. Write a function to split an array into m subarrays such that the largest sum among these subarrays is minimized using Binary Search.
4. Implement a function to find the minimum number of days required to make m bouquets from an array of bloom days using Binary Search.
5. Write a function to find the smallest distance pair in an array using Binary Search.
6. Implement a function to allocate the minimum number of pages to students such that the maximum pages allocated is minimized using Binary Search.
7. Write a function to find the minimum capacity of a boat to carry people with a weight limit using Binary Search.
8. Implement a function to maximize the minimum distance between cows placed in stalls using Binary Search.
9. Write a function to minimize the maximum difference between the heights of towers using Binary Search.
10. Implement a function to find the smallest subarray with a sum greater than or equal to a target value using Binary Search.
11. Write a function to minimize the maximum sum of m subarrays using Binary Search.
12. Implement a function to find the minimum number of days to eat all bananas with a given eating speed using Binary Search.
13. Write a function to find the maximum number of consecutive values you can make from a coin array using Binary Search.
14. Implement a function to find the minimum eating speed to finish all the piles of bananas within h hours using Binary Search.
15. Write a function to find the maximum length of a rod that can be cut from given lengths using Binary Search.
16. Implement a function to find the minimum time required to paint all boards by k painters using Binary Search.
17. Write a function to find the maximum number of chocolates a child can eat using Binary Search.
18. Implement a function to find the minimum number of days to make m bouquets from bloom day array using Binary Search.
19. Write a function to find the maximum sum of a subarray with a given length using Binary Search.
20. Implement a function to find the smallest side length of a square that covers all points in a grid using Binary Search.
21. Write a function to minimize the maximum difference between the sum of two subsets using Binary Search.
22. Implement a function to find the minimum largest sum of subarrays of size k using Binary Search.
23. Write a function to find the maximum sum of a k-length subarray using Binary Search.
24. Implement a function to find the smallest distance between two elements in a sorted array using Binary Search.
25. Write a function to find the maximum area of a rectangle formed by binary matrix using Binary Search.
26. Implement a function to find the minimum height difference between k trees using Binary Search.
27. Write a function to find the maximum number of non-overlapping subarrays with sum at least k using Binary Search.
28. Implement a function to find the minimum difference between the sum of two arrays using Binary Search.
29. Write a function to find the maximum length of a valid parenthesis substring using Binary Search.
30. Implement a function to find the minimum cost to cut a stick into pieces using Binary Search.

Beginner Level: View

Advanced Level: View