add 2859

Author: fishercoder1534

Diff for: paginated_contents/algorithms/3rd_thousand/README.md

@@ -9,6 +9,7 @@
 | 2873 | [Maximum Value of an Ordered Triplet I](https://leetcode.com/problems/maximum-value-of-an-ordered-triplet-i/)                                                                                                             | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2873.java)                                       |                                      | Easy                                     |
 | 2869 | [Minimum Operations to Collect Elements](https://leetcode.com/problems/minimum-operations-to-collect-elements/)                                                                                                             | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2869.java)                                       |                                      | Easy                                     |
 | 2864 | [Maximum Odd Binary Number](https://leetcode.com/problems/maximum-odd-binary-number/)                                                                                                             | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2864.java)                                       |                                      | Easy                                     |Greedy
+| 2859 | [Sum of Values at Indices With K Set Bits](https://leetcode.com/problems/sum-of-values-at-indices-with-k-set-bits/)                                                                                                             | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2859.java)                                       |                                      | Easy                                     |
 | 2839 | [Check if Strings Can be Made Equal With Operations I](https://leetcode.com/problems/check-if-strings-can-be-made-equal-with-operations-i/)                                                                                                          | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2839.java)                                       |                                      | Easy                                     |
 | 2833 | [Furthest Point From Origin](https://leetcode.com/problems/furthest-point-from-origin/)                                                                                                          | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2833.java)                                       |                                      | Easy                                     |
 | 2828 | [Check if a String Is an Acronym of Words](https://leetcode.com/problems/check-if-a-string-is-an-acronym-of-words/)                                                                                                          | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2828.java)                                       |                                      | Easy                                     |

Diff for: src/main/java/com/fishercoder/solutions/thirdthousand/_2859.java

@@ -0,0 +1,28 @@
+package com.fishercoder.solutions.thirdthousand;
+
+import java.util.List;
+
+public class _2859 {
+    public static class Solution1 {
+        public int sumIndicesWithKSetBits(List<Integer> nums, int k) {
+            int sum = 0;
+            for (int i = 0; i < nums.size(); i++) {
+                if (setbit(i, k)) {
+                    sum += nums.get(i);
+                }
+            }
+            return sum;
+        }
+
+        private boolean setbit(int num, int k) {
+            String bin = Integer.toBinaryString(num);
+            int ones = 0;
+            for (char c : bin.toCharArray()) {
+                if (c == '1') {
+                    ones++;
+                }
+            }
+            return ones == k;
+        }
+    }
+}