You are given an array of integers, distance, where each element represents the length of a move you will make on an X-Y plane. You start at the origin, which is point $(0, 0)$, and move according to the array. Specifically, you move distance[0] meters north, distance[1] meters west, distance[2] meters south, distance[3] meters east, and continue this pattern in a counterclockwise direction. Each step follows the sequence—north, west, south, east—repeating as long as there are remaining distances in the array.

Your task is to determine whether this path crosses itself at any point. This means checking whether you revisit any previously visited position (including the origin or any other point) at any step. Return TRUE if the path intersects itself, and FALSE otherwise.

Constraints:

• 1 $\leq$ distance.length $\leq$ $10^3$

• 1 $\leq$ distance[i] $\leq$ $10^3$

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 on how to solve this problem.

Implement your solution in the following coding playground.