DSA Day 3/100

Topic: Array Questions Attempted: 1 1Sum Pair closest to X int[] sumClosest(int[] arr, int x) { if(arr.length==2){ return arr; } int[] arr2 = new int[arr.length]; int prevSum=x; int newSum=0; ...