Hint for DiffK problem


#1

Comment body go ```
int Solution::diffPossible(vector &A, int B) {
int n,i,j=n-1;
n=A.size();
for(i=0;i<n-1;i++)
{

    for(j=n-1;j>i;j--)
    {
        if(A[j]-A[i]==B)
        {
            return 1;
        }
        else if(A[j]-A[i]<B)
        {
            break;
        }
        
    }
}
return 0;

}