Leetcode 2515. Shortest Distance to Target String in a Circular Array

Given a circular array of strings and a start index, return the minimum number of steps (moving left or right with wraparound) needed to reach any occurrence of target, or -1 if target is absent. Essentially compute the smallest circular distance between startIndex and any index i where words[i] == target.