Given a $0$ indexed integer array nums and two integers target and start, find an index i such that nums[i] == target and $|i -$ start$|$ is minimized.

Return the minimum value of $|i -$ start|$.

Constraints:

• $1 \leq$ nums.length $\leq 1000$

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

• $0 \leq$ start $<$ nums.length

• target is in nums.

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.