You are given an integer array nums of length n and an integer k.

Calculate the sum of the k largest elements in nums and the sum of the k smallest elements in nums.

Return the absolute difference between these two sums.

Constraints:

• $1 \leq$ n $==$ nums.length $\leq 100$

• $1 \leq$ nums[i] $\leq 100$

• $1 \leq$ k $\leq$ n

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.