132 Pattern

medium

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 &lt; j &lt; k and nums[i] &lt; nums[k] &lt; nums[j].
Return true if there is a 132 pattern in nums, otherwise, return false.

Input Format

A number n. n1 n2 .... n numbers

Output Format

print true if 132 pattern is found otherwise false.

Constraints

1.  n == nums.length
2.  1 &lt;= n &lt;= 10^4
3.  -10^9 &lt;= nums[i] &lt;= 10^9

Notice

Try First, Check Solution later

1. You should first read the question and watch the question video.
2. Think of a solution approach, then try and submit the question on editor tab.
3. We strongly advise you to watch the solution video for prescribed approach.

Example

Input

Output

true

Exclusive Time Of Functions

Remove K Digits

Related Questions

medium Next Greater Element To The Right easy Next Greater Element I easy Next Greater Element Ii medium Validate Stack Sequences medium Design A Stack With Increment Operation medium Minimum Add To Make Parentheses Valid medium Score Of Parentheses medium Reverse Substrings Between Each Pair Of Parentheses medium Minimum Remove To Make Valid Parentheses medium Online Stock Span medium Exclusive Time Of Functions medium Remove K Digits medium Asteroid Collision medium Remove Duplicate Letters hard Largest Area Histogram 2 hard Maximal Rectangle