add 2200

Author: fishercoder1534

README.md

@@ -8,6 +8,7 @@ _If you like this project, please leave me a star._ ★
 
 | #    |      Title     | Solutions                                                                                                                                | Video                                                                         | Difficulty  | Tag                  
 |------|----------------|------------------------------------------------------------------------------------------------------------------------------------------|-------------------------------------------------------------------------------|-------------|-------------
+| 2200 |[Find All K-Distant Indices in an Array](https://leetcode.com/problems/find-all-k-distant-indices-in-an-array/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2200.java)                                                                     || Easy                                                                          ||
 | 2194 |[Cells in a Range on an Excel Sheet](https://leetcode.com/problems/cells-in-a-range-on-an-excel-sheet/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2194.java)                                                                     || Easy                                                                          ||
 | 2190 |[Most Frequent Number Following Key In an Array](https://leetcode.com/problems/most-frequent-number-following-key-in-an-array/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2190.java)                                                                     || Easy                                                                          ||
 | 2186 |[Minimum Number of Steps to Make Two Strings Anagram II](https://leetcode.com/problems/minimum-number-of-steps-to-make-two-strings-anagram-ii/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2186.java)                                                                     || Medium                                                                        ||

src/main/java/com/fishercoder/solutions/_2200.java

@@ -0,0 +1,29 @@
+package com.fishercoder.solutions;
+
+import java.util.ArrayList;
+import java.util.Collections;
+import java.util.List;
+
+public class _2200 {
+    public static class Solution1 {
+        public List<Integer> findKDistantIndices(int[] nums, int key, int k) {
+            List<Integer> ans = new ArrayList<>();
+            List<Integer> keyIndices = new ArrayList<>();
+            for (int i = 0; i < nums.length; i++) {
+                if (nums[i] == key) {
+                    keyIndices.add(i);
+                }
+            }
+            for (int i = 0; i < nums.length; i++) {
+                for (int j = 0; j < keyIndices.size(); j++) {
+                    if (Math.abs(i - keyIndices.get(j)) <= k) {
+                        ans.add(i);
+                        break;
+                    }
+                }
+            }
+            Collections.sort(ans);
+            return ans;
+        }
+    }
+}