334. Increasing Triplet Subsequence. (C++) (Explanation + code)

Given an unsorted array return whether an increasing subsequence of length 3 exists or not in the array. Formally the function should: Return true if there exists i, j, k Note: Your algorithm should run in O (n) time complexity and O (1) space complexity.