You are given two positive integers, n and k.

An array of distinct positive integers is defined as a k avoiding array if there does not exist any pair of distinct elements that sum to k.

Return the minimum possible sum of a k avoiding array of length n.

Constraints:

• $1 \leq$ n, k $\leq 50$

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.