add 2917

Author: fishercoder1534

paginated_contents/algorithms/3rd_thousand/README.md

@@ -6,6 +6,7 @@
 | 2965 | [Find Missing and Repeated Values](https://leetcode.com/problems/find-missing-and-repeated-values/)                                                                                                             | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2965.java)                                       |                                      | Easy                                     |
 | 2942 | [Find Words Containing Character](https://leetcode.com/problems/find-words-containing-character/)                                                                                                             | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2942.java)                                       |                                      | Easy                                     |
 | 2937 | [Make Three Strings Equal](https://leetcode.com/problems/make-three-strings-equal/)                                                                                                             | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2937.java)                                       |                                      | Easy                                     |
+| 2917 | [Find the K-or of an Array](https://leetcode.com/problems/find-the-k-or-of-an-array/)                                                                                                             | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2917.java)                                       |                                      | Easy                                     |
 | 2913 | [Subarrays Distinct Element Sum of Squares I](https://leetcode.com/problems/subarrays-distinct-element-sum-of-squares-i/)                                                                                                             | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2913.java)                                       |                                      | Easy                                     |
 | 2908 | [Minimum Sum of Mountain Triplets I](https://leetcode.com/problems/minimum-sum-of-mountain-triplets-i/)                                                                                                             | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2908.java)                                       |                                      | Easy                                     |
 | 2903 | [Find Indices With Index and Value Difference I](https://leetcode.com/problems/find-indices-with-index-and-value-difference-i/)                                                                                                             | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2903.java)                                       |                                      | Easy                                     |

src/main/java/com/fishercoder/solutions/thirdthousand/_2917.java

@@ -0,0 +1,27 @@
+package com.fishercoder.solutions.thirdthousand;
+
+public class _2917 {
+    public static class Solution1 {
+        public int findKOr(int[] nums, int k) {
+            String[] strings = new String[nums.length];
+            for (int i = 0; i < nums.length; i++) {
+                strings[i] = Integer.toBinaryString(nums[i]);
+            }
+            int ans = 0;
+            int base = 1;
+            for (int i = 1; i < 64; i++) {
+                int setBits = 0;
+                for (String str : strings) {
+                    if (str.length() >= i) {
+                        setBits += Integer.parseInt(str.charAt(str.length() - i) + "");
+                    }
+                }
+                if (setBits >= k) {
+                    ans += base;
+                }
+                base *= 2;
+            }
+            return ans;
+        }
+    }
+}

src/test/java/com/fishercoder/thirdthousand/_2917Test.java

@@ -0,0 +1,22 @@
+package com.fishercoder.thirdthousand;
+
+import com.fishercoder.solutions.thirdthousand._2917;
+import org.junit.jupiter.api.BeforeEach;
+import org.junit.jupiter.api.Test;
+
+import static org.junit.jupiter.api.Assertions.assertEquals;
+
+public class _2917Test {
+    private static _2917.Solution1 solution1;
+
+    @BeforeEach
+    public void setup() {
+        solution1 = new _2917.Solution1();
+    }
+
+    @Test
+    public void test1() {
+        assertEquals(9, solution1.findKOr(new int[]{7, 12, 9, 8, 9, 15}, 4));
+    }
+
+}