Available question text
Determine whether the array contains indices i < j < k such that nums[i] < nums[k] < nums[j] (a "132" subsequence). With n up to 2·10^5, an O(n) or O(n log n) approach is required, typically using a monotonic stack or tracking minimum-left and candidate "2"/"3" values.
Related questions
Continue with questions that share topics or the same question type.
- Binary Searchable Numbers in an Unsorted Array
Coding · Array · Binary Search · Monotonic Stack
- Beautiful Towers II
Coding · Array · Monotonic Stack · Stack
- Block Placement Queries
Coding · Array · Binary Indexed Tree · Binary Search
- Buildings With an Ocean View
Coding · Array · Monotonic Stack · Stack
Sources · 2 references
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 456. 132 Pattern
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source
LeetCode company tags · 1 record
DoorDash
132 Pattern
Reported date not specified · Source window: 6mo
Source snapshot: Oct 20, 2026
Source frequency score: 100. This is not an interview probability.
View source