Diffk
Given an array ‘A’ of sorted integers and another non negative integer k, find if there exists 2 indices i and j such that A[i] - A[j] = k, i != j.
Example:
Input :
A : [1 3 5]
k : 4
Output :
YES
as
5 - 1 = 4
Return 0 / 1
( 0 for false, 1 for true ) for this problem
Try doing this in less than linear space complexity.
public class Solution {
public int diffPossible(ArrayList<Integer> A, int target) {
int i = 0, j = 0;
while (j < A.size()) {
if (i != j)
if (A.get(j) - A.get(i) == target)
return 1;
else if (A.get(j) - A.get(i) > target)
i++;
else
j++;
else
j++;
}
return 0;
}
}
Last updated