Practice 132 Pattern
Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.
Problem Statement
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.
Source: 132 Pattern on LeetCode. Use the original task for its coding environment and submissions.
Examples
# Example 1
Input
nums = [1,2,3,4]
Output
false
# Example 2
Input
nums = [3,1,4,2]
Output
true
# Example 3
Input
nums = [-1,3,2,0]
Output
true
Constraints
n == nums.length
1 <= n <= 2 * 10^5
-10^9 <= nums[i] <= 10^9
Related LeetCode Problems
Practice more problems similar to 132 Pattern.
Review your practice with PhantomCodeAI
After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.