Leetcode 334. Increasing Triplet Subsequence

Check whether the array contains an increasing triplet subsequence (indices i<j<k with nums[i]<nums[j]<nums[k]). The challenge is to do it efficiently for n up to 5e5 — optimal solutions scan once while tracking two candidate minima (O(n) time, O(1) space).