Given an array of n integers nums, a 132 pattern is a subsequence of three integers nums[i], nums[j] and nums[k] such that i < j < k and nums[i] < nums[k] < nums[j]. Return true if there is a 132 ...

// popped is "k"; popped < x). // - if x < k: x can serve as nums[i], we have a 132 — return true. // - else push x.