Given the head of a singly linked list, determine the minimum and maximum distances between any two critical points.

A node is defined as a critical point if it is either a local maximum or a local minimum:

• A node is a local maximum if its value is strictly greater than the value of the previous node and strictly greater than the value of the next node.

• A node is a local minimum if its value is strictly smaller than the value of the previous node and strictly smaller than the value of the next node.

Return an integer array of length $2$ containing [minDistance, maxDistance], where minDistance is the minimum distance between any two distinct critical points and maxDistance is the maximum distance between any two distinct critical points. If there are fewer than $2$ critical points, return [-1, -1].

Note: A node can only be considered a critical point if it has both a preceding node and a succeeding node.

Constraints:

• The number of nodes in the list is in the range $[2, 10^5]$.

• $1 \leq$ Node.val $\leq 10^5$

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.