Shortest Distance to Target String in a Circular Array: coding question

Available question text

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.

Continue with questions that share topics or the same question type.

Shortest Distance to Target Color
Coding
A Graph question, a string question, a couple of array questions.
Coding
Asked LC medium problems. Problems were not difficult, even without preparation--all related to string manipulation or array manipulation.
Coding
Check If String Is a Prefix of Array
Coding

Sources · 1 reference

These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.

Hello Interview · 1 record

No company association
Leetcode 2515. Shortest Distance to Target String in a Circular Array
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source

Shortest Distance to Target String in a Circular Array

Available question text

Related questions

Shortest Distance to Target String in a Circular Array

Available question text

Related questions