` ````
```

Loading Question ...

Given a sequence of n integers a_{1}, a_{2}, ..., a_{n}, a 132 pattern is a subsequence a_{i}, a_{j}, a_{k} such
that **i** < **j** < **k** and a_{i} < a_{k} < a_{j}. Design an algorithm that takes a list of n numbers as input and checks whether there is a 132 pattern in the list.

**Note:** n will be less than 15,000.

**Example 1:**

Input:[1, 2, 3, 4]Output:FalseExplanation:There is no 132 pattern in the sequence.

**Example 2:**

Input:[3, 1, 4, 2]Output:TrueExplanation:There is a 132 pattern in the sequence: [1, 4, 2].

**Example 3:**

Input:[-1, 3, 2, 0]Output:TrueExplanation:There are three 132 patterns in the sequence: [-1, 3, 2], [-1, 3, 0] and [-1, 2, 0].

Seen this question in a real interview before?

Yes

No

When did you encounter this question?

last week

last month

last 3 month

last 6 month

more than 6 months

other

Which stage?

Online Assessment

Phone Interview

On Campus Interview

Onsite Interview

Don't know

Which company?

Adobe

Aetion

Airbnb

Alibaba

Amazon

Apple

Baidu

Bloomberg

Cloudera

Coursera

Cryptic Studios

Dropbox

eBay

Epic Systems

Expedia

Facebook

Fallible

Games

Gilt Groupe

GoDaddy

Goo

Google

Hedvig

Helix

Houzz

Hulu

Indeed

Intuit

IXL

LinkedIn

LiveRamp

Lyft

MAQ Software

Mathworks

Microsoft

NetEase

Netsuite

Palantir

Palantir Technologies

Pinterest

Pocket Gems

Poynt

Pure

Pure Storage

Rackspace

Radius

Riot

Riot Games

Samsung

Snapchat

Square

Storage

Tencent

TinyCo

Twitter

Two Sigma

Uber

Valve

WAP

Works Applications

Yahoo

Yahoo!

Yelp

Zappos

Zenefits

How can we help you?