Already approved by someone
approved
merged, thanks!
ok, you are right. It's done
added (i dont think it really makes the testing more robust but you're the boss ^^)
Yeah, could be better worded as said Chrono79; actually you don't have to check exclusive pairs, just can you find a neighbour somewhere in the array.
Not a kata issue. The wording could be better tho and an example showing multiplicity is not something you should have in mind would be nice.
for every value n in the array, there is also an element n-1 or n+1 in the array.
What's the problem? There are 2 values: n=2 -> n+1 is in the array, n=3 -> n-1 is in the array.
I can not see the solution since I am yet to complete the kata, I just need a hint :)
Loading collection data...
Already approved by someone
approved
merged, thanks!
ok, you are right. It's done
added (i dont think it really makes the testing more robust but you're the boss ^^)
Yeah, could be better worded as said Chrono79; actually you don't have to check exclusive pairs, just can you find a neighbour somewhere in the array.
Not a kata issue. The wording could be better tho and an example showing multiplicity is not something you should have in mind would be nice.
for every value n in the array, there is also an element n-1 or n+1 in the array.What's the problem? There are 2 values: n=2 -> n+1 is in the array, n=3 -> n-1 is in the array.
I can not see the solution since I am yet to complete the kata, I just need a hint :)