<p>Given an integer array <code>nums</code><strong>(0-indexed)</strong> and two integers <code>target</code> and <code>start</code>, find an index <code>i</code> such that <code>nums[i] == target</code> and <code>abs(i - start)</code> is <strong>minimized</strong>. Note that <code>abs(x)</code> is the absolute value of <code>x</code>.</p>
<p>Return <code>abs(i - start)</code>.</p>
<p>It is <strong>guaranteed</strong> that <code>target</code> exists in <code>nums</code>.</p>