Merge pull request #3321 from adhamahmad/adham-branch

Create: 1968-array-with-elements-not-equal-to-average-of-neighbors.java, 0658-find-k-closest-elements.java

Author: MHamiid

java/0658-find-k-closest-elements.java

@@ -0,0 +1,19 @@
+class Solution {
+    public List<Integer> findClosestElements(int[] arr, int k, int x) {
+        int l =0;
+        int r = arr.length -k;
+        List<Integer> result = new ArrayList<>();
+        while( l < r){
+            int m = (l+r) /2;
+            if(x - arr[m] > arr[m+k] -x ){ //right is closer
+                l = m+1;
+            }else{ //left is closer
+                r =m;
+            }
+        }
+        for(int i =l; i < l+k; i++){ //build the solution list
+            result.add(arr[i]);
+        }
+        return result;
+    }
+}

java/1968-array-with-elements-not-equal-to-average-of-neighbors.java

@@ -0,0 +1,12 @@
+class Solution {
+    public int[] rearrangeArray(int[] nums) { 
+        for(int i=1; i <= nums.length-2; i++){
+            if( ( ( nums[i-1] < nums[i] && nums[i] < nums[i+1] ) || ( nums[i-1] > nums[i] && nums[i] > nums[i+1] ) )){ //swap
+                int temp = nums[i+1];
+                nums[i+1] = nums[i];
+                nums[i] = temp; 
+            }
+        }
+        return nums;
+    }
+}