how to find a array is almost increasing Sequence by omitting only one element in java : I am trying to solve some code in codefights.com. I have given the following problem where I am stuck right now. If I want to see the hint there I have to spent 5000 points which I don't want to. Can anybody help me for this please? I am not having the perfect logic for this. Here is the problem below : 

    Given a sequence of integers as an array, determine whether it is possible 
    to obtain a strictly increasing sequence by removing no more than one element from the array.
    
    Example : 
    
    For sequence = [1, 3, 2, 1], the output should be
    almostIncreasingSequence(sequence) = false;
    
    There is no one element in this array that can be removed in order to 
    get a strictly increasing sequence.
    
    For sequence = [1, 3, 2], the output should be
    almostIncreasingSequence(sequence) = true.
    
    You can remove 3 from the array to get the strictly increasing sequence [1, 2]. 
    Alternately, you can remove 2 to get the strictly increasing sequence [1, 3].
    
    
    
    [output] boolean
    
    Return true if it is possible to remove one element from the array in order to 
    get a strictly increasing sequence, otherwise return false.


I have tried as follows :

    boolean almostIncreasingSequence(int[] sequence) {
        ArrayList<Integer> list = new ArrayList<Integer>();

        for(int i=0; i<sequence.length;i++) {
            list.add(sequence[i]);
        }

        int omittedCounter = 0;

        boolean status = true;

        for(int i=1; i<list.size();i++) {
            if(list.get(i-1) >= list.get(i)) {
                omittedCounter ++;
                list.remove(i-1);
                break;
            }
        }

        if (omittedCounter > 0) {
            for(int i=1; i<list.size();i++) {
                if(list.get(i-1) >= list.get(i)) {
                    omittedCounter ++;
                    list.remove(i-1);
                    break;
                }
            }
        }

        if (omittedCounter > 1) {
            status = false;
        }
        
    return status;
}

But I am having trouble when I am given this sequence >>>

    Input:            sequence: [1, 2, 3, 4, 3, 6]
    Output:           false
    Expected Output:  true