Binary Search is a searching algorithm used in a sorted array by repeatedly dividing the search interval in half. The idea of binary search is to use the information that the array is sorted and reduce the time complexity to O(Log n).
MinMaxDivision
Divide array A into K blocks and minimize the largest sum of any block.
Difficulty Level: Medium
NailingPlanks
Count the minimum number of nails that allow a series of planks to be nailed.
Difficulty Level: Medium