LeetCode Solutions/LeetCoding Challenge/December 2019 LeetCoding Challenge/Increasing Triplet Subsequence.java
class Solution {
    public boolean increasingTriplet(int[] nums) {
        int left = Integer.MAX_VALUE, mid = Integer.MAX_VALUE;
        for(int i : nums){
            if(i <= left){
                left = i;
            }
            else if(i <= mid){
                mid = i;
            } else{
                return true;
            }
        }
        return false;
    }
}