private int removeFromEnd(int input[],int low,int high){
        if(low > high){
            return input.length;
        }
        int min = min(input,low,high);
        int max = max(input,low,high);
        if(2*min > max){
            return 0;
        }

        return Math.min(removeFromEnd(input,low,high-1), removeFromEnd(input,low+1,high)) +1;
    }
http://www.geeksforgeeks.org/remove-minimum-elements-either-side-2min-max/
src/com/interview/dynamic/RemoveFromEndToMake2IntoMinGreaterThanMax.java