Given an integer array nums, determine whether there exist indices i, j, and k such that i < j < k and the values form a 132 pattern, meaning nums[i] < nums[k] < nums[j]. Return true if at least one such triple exists, otherwise return false.

Constraints:

• n == nums.length

• $1 \leq$ n $\leq 2 \cdot 10^5$

• $-10^9 \leq$ nums[i] $\leq 10^9$

Input: nums = [2, 5, 1, 4, 3]-List[int]
Output: true-bool
Explanation: Choosing i=0, j=1, k=4 gives nums[i]=2, nums[j]=5, nums[k]=3. Since 2 < 3 < 5 and 0 < 1 < 4, a 132 pattern exists.

Input: nums = [1, 0, 1, -4, -3]-List[int]
Output: false-bool
Explanation: No indices i < j < k satisfy nums[i] < nums[k] < nums[j]. The later values are too small to fit between a smaller left value and a larger middle value in the required order.

Input: nums = [7, 6, 5, 4, 3, 2, 1]-List[int]
Output: false-bool
Explanation: The array is strictly decreasing, so for any i < j < k, we have nums[i] > nums[j] > nums[k], making nums[i] < nums[k] impossible.

Input: nums = [-1000000000, 1000000000, 0]-List[int]
Output: true-bool
Explanation: Choosing i=0, j=1, k=2 gives -10^9 < 0 < 10^9, which matches the 132 pattern.

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.