1 Given a sorted array and a target value, return the index if the target is found. If not, return the index where it would be if it were inserted in order.
2 
3 You may assume no duplicates in the array.

1 Given a big sorted array with positive integers sorted by ascending order. The array is so big so that you can not get the length of the whole array directly, and you can only access the kth number by ArrayReader.get(k) (or ArrayReader->get(k) for C++). Find the first index of a target number. Your algorithm should be in O(log k), where k is the first index of the target number.
2 
3 Return -1, if the number doesn‘t exist in the array.
4 
5  Notice
6 
7 If you accessed an inaccessible index (outside of the array), ArrayReader.get will return 2,147,483,647.

1 Given n pieces of wood with length L[i] (integer array). Cut them into small pieces to guarantee you could have equal or more than k pieces with the same length. What is the longest length you can get from the n pieces of wood? Given L & k, return the maximum length of the small pieces.
2 
3  Notice
4 
5 You couldn‘t cut wood into float length.