132 Pattern
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 pattern in nums; otherwise, return false.
Example 1
Input
nums = [1,2,3,4]Output
falseThere is no 132 pattern in the sequence.
Example 2
Input
nums = [3,1,4,2]Output
trueThere is a 132 pattern in the sequence: [1, 4, 2].
Constraints
- n == nums.length
- 1 <= n <= 2 * 10^5
- -10^9 <= nums[i] <= 10^9
Asked at 9 companies
Practice questions like this out loud in a mock coding interview with a live AI interviewer. First one free.