solves #2515: Shortest Distance to Target String in a Circular Array in java

Author: anishLearnsToCode

README.md

@@ -790,7 +790,7 @@
 | 2500 | [Delete Greatest Value in Each Row](https://leetcode.com/problems/delete-greatest-value-in-each-row)                                                                   |                                                                                [![Java](assets/java.png)](src/DeleteGreatestValueInEachRow.java)                                                                                 |                                                                                                                                   |
 | 2506 | [Count Pairs Of Similar Strings](https://leetcode.com/problems/count-pairs-of-similar-strings)                                                                         |                                                                                 [![Java](assets/java.png)](src/CountPairsOfSimilarStrings.java)                                                                                  |                                                                                                                                   |
 | 2511 | [Maximum Enemy Forts That Can Be Captured](https://leetcode.com/problems/maximum-enemy-forts-that-can-be-captured)                                                     |                                                                             [![Java](assets/java.png)](src/MaximumEnemyFortsThatCanBeCaptured.java)                                                                              |                                                                                                                                   |
-| 2515 | [Shortest Distance to Target String in a Circular Array](https://leetcode.com/problems/shortest-distance-to-target-string-in-a-circular-array)                         |                                                                                                                                                                                                                                  |                                                                                                                                   |
+| 2515 | [Shortest Distance to Target String in a Circular Array](https://leetcode.com/problems/shortest-distance-to-target-string-in-a-circular-array)                         |                                                                       [![Java](assets/java.png)](src/ShortestDistanceToTargetStringInACircularArray.java)                                                                        |                                                                                                                                   |
 | 2520 | [Count the Digits That Divide a Number](https://leetcode.com/problems/count-the-digits-that-divide-a-number)                                                           |                                                                                                                                                                                                                                  |                                                                                                                                   |
 | 2525 | [Categorize Box According to Criteria](https://leetcode.com/problems/categorize-box-according-to-criteria)                                                             |                                                                                                                                                                                                                                  |                                                                                                                                   |
 | 2529 | [Maximum Count of Positive Integer and Negative Integer](https://leetcode.com/problems/maximum-count-of-positive-integer-and-negative-integer)                         |                                                                                                                                                                                                                                  |                                                                                                                                   |

src/ShortestDistanceToTargetStringInACircularArray.java

@@ -0,0 +1,17 @@
+// https://leetcode.com/problems/shortest-distance-to-target-string-in-a-circular-array
+// T: O(N)
+// S: O(1)
+
+public class ShortestDistanceToTargetStringInACircularArray {
+    public int closetTarget(String[] words, String target, int startIndex) {
+        if (words[startIndex].equals(target)) return 0;
+
+        for (int left =  (startIndex - 1 + words.length) % words.length, right = (startIndex + 1) % words.length, count = 1;
+             count <= words.length / 2;
+             left = (left - 1 + words.length) % words.length, right = (right + 1) % words.length, count++
+        ) {
+            if (words[left].equals(target) || words[right].equals(target)) return count;
+        }
+        return -1;
+    }
+}