Increasing Triplet Subsequence

Given an unsorted array of integers, find if there is an increasing triplet subsequence.

An increasing triplet subsequence is a subsequence of three integers in the array (not necessarily adjacent) such that the subsequence forms an increasing sequence, i.e., for indices i, j, and k where i < j < k, nums[i] < nums[j] < nums[k].