@@ -0,0 +1,644 @@
+public class Solution %7B%0A  public static int%5B%5D findLeastDisruptiveSubrange(int%5B%5D arr, int%5B%5D replace) %7B%0A    if (arr.length == 0 %7C%7C replace.length == 0 %7C%7C arr.length %3C replace.length) %7B%0A      return new int%5B2%5D;%0A    %7D%0A%0A%0A    int minI = 0;%0A    int minJ = 0;%0A    int minDiff = Integer.MAX_VALUE;;%0A    for (int i = 0; i %3C arr.length - replace.length; i ++) %7B%0A      int cur = 0;%0A      for (int j = 0; j %3C replace.length; j ++) %7B%0A        cur += Math.abs(arr%5Bi + j%5D - replace%5Bj%5D);%0A      %7D%0A%0A      if (cur %3C minDiff) %7B%0A        minI = i;%0A        minJ = i + replace.length - 1;%0A        minDiff = cur;%0A      %7D%0A    %7D%0A%0A    return new int%5B%5D %7B minI, minJ %7D;%0A  %7D%0A%7D%0A

Add jackson gabbard problem #1