Given an array of unique integers preorder, return true if it represents the correct preorder traversal sequence of a binary search tree, or false otherwise.

Constraints:

• $1 \leq$ preorder.length $\leq 10^4$

• $1 \leq$ preorder[i] $\leq 10^4$

• All the elements of preorder are unique.

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.