You are given an integer array nums.

Split the elements of nums into two groups according to their indices:

• An array A containing each element nums[i] where index i is a prime number.

• An array B containing each element nums[i] where index i is not a prime number.

Return the absolute difference between the sum of the elements in A and the sum of the elements in B.

Note: An integer $p > 1$ is a prime number if its only positive divisors are $1$ and $p$. The numbers $0$ and $1$ are not prime numbers.

Constraints:

• $1 \leq$ nums.length $\leq 10^5$

• $-10^9 \leq$ nums[i] $\leq 10^9$

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.