Min Max Division is a Codility exercise that can be solved by doing a binary search. The aim of the exercise is to take an array and split it into a specified number of blocks. The split points of the blocks should minimise the maximum sum of the values within any one block.
This solution scores 100% first time in Codility. The result is guessed and the array is tested to see if the array can be split to produce the result. The method then uses a binary search to home in on the best result.
