Help me in solving SUBINC problem

help
,
1

My issue

In Example Case 1, why is [2,3] not a subarray ?

My code

# cook your dish here
for i in range(int(input())):
    n=int(input())
    l=list(map(int,input().split()))
    d=[]
    l.sort()
    for j in range(n):
        d.append([l[j],l[j]])
        for k in range(i+1,n):
            if l[k]>=l[j] and abs(l[j]-l[k])==1:
                d.append([l[j],l[k]])
    print(d)
    print(len(d))

Learning course: Dynamic programming
Problem Link: CodeChef: Practical coding for everyone

2

@hyper_real123
[2,3] have values 4 and 2 which is decreasing order.
u don’t need to count these subarray in answer.

3

I’m so sorry but I don’t really understand.
Can you please elaborate it a little more

4

@hyper_real123
The values at index 2,3(considering 1 based indexing) are [4,2] which is not in increasing order so u need not to count such subarrays in your answer.