public static void main(String args[]) {
        IncreasingTripletSubsequence tripletSubsequence = new IncreasingTripletSubsequence();
        int input[] = {9, 10, -2, 12, 6, 7, -1};
        System.out.print(tripletSubsequence.increasingTriplet(input));
    }
Date 03/06/2016
@author Tushar Roy

Find if there exists an increasing triplet subsequence.
Similar method to longest increasing subsequence in nlogn time.

Time complexity is O(n)
Space complexity is O(1)

https://leetcode.com/problems/increasing-triplet-subsequence/
src/com/interview/array/IncreasingTripletSubsequence.java