NeetCode #372LC-456MediumStack
← Back to All Problems#372 · #456 · 132 Pattern(132 模式)
📌 Problem Statement & Constraints
Given an array of
n integers nums, return true if there is a 132 pattern: indices i < j < k with nums[i] < nums[k] < nums[j]. Constraints: 1 <= n <= 2 * 10^5, -10^9 <= nums[i] <= 10^9.🔒
Sign In to Unlock Full Solutions for All 973 Problems
Sign in to access step-by-step logic, benchmark Python3 code, complexity breakdown, and offline export!