A TEST CASE COULD FAIL WITH THIS APPROACH

#1

If the chopsticks are.
1 1 3 3 6 7
and d = 2

then if we are checking consecutive chopsticks’s difference,
Then in the very first case we will loose a pair .

Here the pairs can 1 3, 13.

#2

hi @anmolsri1_27cc712632507b5a,
the question says --> if diff can be atmost d not equal to d
so pair can be {1,1} {3,3} and {6,7}

#3

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.