2859. Sum of Values at Indices With K Set Bits LeetCode Solution
In this guide, you will get 2859. Sum of Values at Indices With K Set Bits LeetCode Solution with the best time and space complexity. The solution to Sum of Values at Indices With K Set Bits problem is provided in various programming languages like C++, Java, and Python. This will be helpful for you if you are preparing for placements, hackathons, interviews, or practice purposes. The solutions provided here are very easy to follow and include detailed explanations.
Problem Statement of Sum of Values at Indices With K Set Bits
You are given a 0-indexed integer array nums and an integer k.
Return an integer that denotes the sum of elements in nums whose corresponding indices have exactly k set bits in their binary representation.
The set bits in an integer are the 1’s present when it is written in binary.
For example, the binary representation of 21 is 10101, which has 3 set bits.
Example 1:
Input: nums = [5,10,1,5,2], k = 1
Output: 13
Explanation: The binary representation of the indices are:
0 = 0002
1 = 0012
2 = 0102
3 = 0112
4 = 1002
Indices 1, 2, and 4 have k = 1 set bits in their binary representation.
Hence, the answer is nums[1] + nums[2] + nums[4] = 13.
Example 2:
Input: nums = [4,3,2,1], k = 2
Output: 1
Explanation: The binary representation of the indices are:
0 = 002
1 = 012
2 = 102
3 = 112
Only index 3 has k = 2 set bits in its binary representation.
Hence, the answer is nums[3] = 1.
2859. Sum of Values at Indices With K Set Bits LeetCode Solution in C++
class Solution {
public:
int sumIndicesWithKSetBits(vector<int>& nums, int k) {
int ans = 0;
for (unsigned i = 0; i < nums.size(); ++i)
if (popcount(i) == k)
ans += nums[i];
return ans;
}
}; /* code provided by PROGIEZ */
2859. Sum of Values at Indices With K Set Bits LeetCode Solution in Java
class Solution {
public int sumIndicesWithKSetBits(List<Integer> nums, int k) {
int ans = 0;
for (int i = 0; i < nums.size(); ++i)
if (Integer.bitCount(i) == k)
ans += nums.get(i);
return ans;
}
} // code provided by PROGIEZ
2859. Sum of Values at Indices With K Set Bits LeetCode Solution in Python
class Solution:
def sumIndicesWithKSetBits(self, nums: list[int], k: int) -> int:
return sum(num for i, num in enumerate(nums)
if i.bit_count() == k) # code by PROGIEZ
