LeetCode 456 132 Pattern(Med, Java, TC O( n) SC O(n))
Problem Statement
456. 132 Pattern
Given an array of n integers nums, a 132 pattern is a subsequence of three integers nums[i], nums[j], nums[k] such that i < j < k and nums[i] < nums[k] < nums[j].
Return true if there is a 132 pattern in nums, oth...
