You are given a $0$-indexed integer array nums and an integer k.

Return an integer denoting the sum of elements in nums whose corresponding indices have exactly k set bits in their binary representation.

The set bits in an integer refer to the number of $1$’s present in its binary form.

Constraints:

• $1 \leq$ nums.length $\leq 1000$

• $1 \leq$ nums[i] $\leq 10^5$

• $0 \leq$ k $\leq 10$

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.