You are given a circular array of strings words and a string target. You are also given an integer startIndex representing your starting position in words.

In a circular array, moving right from the last index leads to the first index, and moving left from the first index leads to the last index.

Starting from startIndex, you can move either left or right by $1$ step at a time.

Return the shortest distance needed to reach any index where the string is equal to target. If target does not exist in words, return $-1$.

Constraints:

• $1 \leq$ words.length $\leq 100$

• $1 \leq$ words[i].length $\leq 100$

• words[i] and target consist of only lowercase English letters.

• $0 \leq$ startIndex $<$ words.length

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.