Issue with "Bonfire: Pairwise". Test wrong?

I was going to do this bonfire, and, after a time thinking about how to do it, I noticed this test:

expect(pairwise([0, 0, 0, 0, 1, 1], 1)).to.equal(10);
expected 1 to equal 10

That’s arr[0] + arr[4] = 0+4 = 4 And arr[1] + arr[5] = 1 + 5 = 6 6 + 4 = 10

These are [0,1] pairs, repeated.

Well, the explanation of this bonfire says this:

Bla bla bla If multiple sums are possible, return the smallest sum. Once an element has been used, it cannot be reused to pair with another.

So, if you get the same pair, Only use the smallest sum of indexes, right? This test breaks this condition. With this, I don’t know if even I can trust in the exercise description. I don’t know if the exercise is wrong, if the description is misleading or if only the test is wrong, but something seems to be wrong.

[richchurcher]

@soulchainer I’ve often thought this exercise and its description caused more confusion than it was worth.

I believe the test is ok, though. It only says once an element has been used it can’t be re-used… it doesn’t say, once an integer has been used. It also asks for the sum of all indices that can be paired. The test provides multiple elements with the same value for the purpose of checking if the provided solution can detect the lowest possible combination. Possible answers include:

[0, 0, 0, 0, 1, 1]
Indices: 0 + 4, 1 + 5 = 10
Indices: 1 + 4, 2 + 5 = 12
Indices: 2 + 4, 3 + 5 = 14

So the test is required to ensure that the solution has correctly picked the lowest sum.

[diogogomeswww]

I don’t understand. The problem clearly says If multiple pairs are possible that have the same numeric elements but different indexes, return the smallest sum of indexes.

So for test case: [0, 0, 0, 0, 1, 1] Indexes: [0,4], [1,5] Values: [0,1],[0,1]

The indexes 1+5 should be not included, hence the answer should be 0+4 = 4, right?