Jun 24

Author: siddydutta

2025-06-June-LeetCoding-Challenge/Find All K-Distant Indices in an Array.py

@@ -0,0 +1,29 @@
+class Solution:
+    def findKDistantIndices(self, nums: list[int], key: int, k: int) -> list[int]:
+        n = len(nums)
+        result = []
+        right = 0
+        for i in range(n):
+            if nums[i] != key:
+                continue
+            left = max(right, i - k)
+            right = min(i + k, n - 1) + 1
+            for j in range(left, right):
+                result.append(j)
+        return result
+
+
+def main():
+    nums = [3, 4, 9, 1, 3, 9, 5]
+    key = 9
+    k = 1
+    assert Solution().findKDistantIndices(nums, key, k) == [1, 2, 3, 4, 5, 6]
+
+    nums = [2, 2, 2, 2, 2]
+    key = 2
+    k = 2
+    assert Solution().findKDistantIndices(nums, key, k) == [0, 1, 2, 3, 4]
+
+
+if __name__ == '__main__':
+    main()

2025-06-June-LeetCoding-Challenge/README.md

@@ -27,7 +27,7 @@
 | June 21 | [3085. Minimum Deletions to Make String K-Special](https://leetcode.com/problems/minimum-deletions-to-make-string-k-special/) | Medium | Solved |
 | June 22 | [2138. Divide a String Into Groups of Size k](https://leetcode.com/problems/divide-a-string-into-groups-of-size-k/) | Easy | Solved |
 | June 23 | [2081. Sum of k-Mirror Numbers](https://leetcode.com/problems/sum-of-k-mirror-numbers/) | Hard | Unsolved |
-| June 24 | []() |  |  |
+| June 24 | [2200. Find All K-Distant Indices in an Array](https://leetcode.com/problems/find-all-k-distant-indices-in-an-array/) | Easy | Solved |
 | June 25 | []() |  |  |
 | June 26 | []() |  |  |
 | June 27 | []() |  |  |
@@ -39,6 +39,6 @@
 ## Summary
 | Level  | Problems | Solved | Unsolved |
 | ---    | --- | --- | --- |
-| Easy   | 3 | 3 | 0 |
+| Easy   | 4 | 4 | 0 |
 | Medium | 10 | 7 | 3 |
 | Hard   | 6 | 2 | 4 |