added

Author: deepzsenu

coding Ninjas/Java/Array/ArrangeNumber

@@ -0,0 +1,20 @@
+
+public class Solution {
+    
+    public static void arrange(int[] arr, int n) {
+    	//Your code goes here
+        int j = 0;
+        for(int  i = 0; i<arr.length; i++){
+            if(i%2==0){
+                arr[j] = i+1;
+                j++;
+            }
+        }
+        for (int i = arr.length; i>0; i--) {
+            if (i % 2 == 0) {
+                arr[j] = i ;
+                j++;
+            }
+        }
+    }
+}

coding Ninjas/Java/Array/FindDuplicates

@@ -0,0 +1,26 @@
+import java.util.*;
+public class Solution{  
+    
+    public static int duplicateNumber(int arr[]) {
+    	//Your code goes here
+        HashMap<Integer, Integer> mp = new HashMap<>();
+
+         for(int i = 0;i<arr.length; i++){
+           
+            if(mp.containsKey(arr[i])){
+                mp.put(arr[i], mp.get(arr[i])+1);
+            }
+            else{
+                mp.put(arr[i], 1);
+            }
+        }
+        int ans = 0;
+        for(int i = 1;i<arr.length; i++){
+            
+            if(mp.get(arr[i])==2){
+                ans =  arr[i];
+            }
+        }
+        return ans;
+    }
+}

coding Ninjas/Java/Array/FindUnique

@@ -0,0 +1,12 @@
+public class Solution{  
+
+    public static int findUnique(int[] arr){
+		//Your code goes here
+    int ans = arr[0];
+    for(int  i = 1; i <arr.length; i++){
+      ans = ans^arr[i];
+
+    }
+    return ans;
+    }
+}

coding Ninjas/Java/Array/IntersectionOfTwoArray

@@ -0,0 +1,22 @@
+import java.util.*;
+public class Solution{  
+    
+    public static void intersections(int arr1[], int arr2[]) {
+    	//Your code goes here
+        int s = -1;
+        for (int i = 0; i < arr1.length; i++) {
+            for (int j = 0; j < arr2.length; j++) {
+                if (arr1[i] == arr2[j]){
+                    System.out.print(arr1[i]+ " ");
+                    arr1[i] = s;
+                    --s;
+                    arr2[j] = s;
+                    --s;
+                }
+                
+            }
+        }
+        // System.out.println();
+
+    }
+}

coding Ninjas/Java/Array/LinearSearch

@@ -0,0 +1,13 @@
+
+public class Solution {
+
+    public static int linearSearch(int arr[], int x) {
+		//Your code goes here
+    for(int i = 0 ;  i <arr.length; i++){
+      if(arr[i] == x){
+        return i;
+      }
+    }
+    return -1;
+    }
+}

coding Ninjas/Java/Array/PairSum

@@ -0,0 +1,17 @@
+import java.util.*;
+public class Solution {  
+
+    public static int pairSum(int arr[], int x) {
+        int s = 0;
+        for(int i = 0; i<arr.length; i++){
+            for(int j  = i+1; j < arr.length; j++){
+                if (arr[i]+arr[j] == x){
+                    s+=1;
+                }
+            }
+        }
+        return s;
+    
+
+    }
+}

coding Ninjas/Java/Array/ReturnArraySum

@@ -0,0 +1,12 @@
+
+public class Solution {
+	
+	public static int sum(int[] arr) {
+		//Your code goes here
+		int s = 0;
+		for( int i = 0; i<arr.length; i++){
+			s+=arr[i];
+		}
+		return s;
+	}
+}

coding Ninjas/Java/Array/Sort01

@@ -0,0 +1,20 @@
+import java.util.*;
+public class Solution {  
+
+    public static void sortZeroesAndOne(int[] arr) {
+    	//Your code goes here
+        int i = 0;
+        int l = arr.length-1;
+        while(i<l){
+            if(arr[i] == 0){
+                i++;
+            }
+            else{
+                int temp = arr[i];
+                arr[i] = arr[l];
+                arr[l] = temp;
+                l--;                
+            }
+        }
+    }
+}

coding Ninjas/Java/Array/SwapAlterNates

@@ -0,0 +1,15 @@
+
+public class Solution {
+    static void swaps(int arr[], int s , int t){
+        int temp = arr[s];
+        arr[s] = arr[t];
+        arr[t] = temp;
+    }
+    
+    public static void swapAlternate(int arr[]) {
+    	//Your code goes here
+        for(int i = 1 ; i<arr.length; i+=2){
+            swaps(arr,i-1, i);
+        }
+    }
+}

coding Ninjas/Java/Array/TripletSum

@@ -0,0 +1,21 @@
+
+public class Solution {
+    
+    public static int findTriplet(int[] arr, int x) {
+    	//Your code goes here
+        int s = 0;
+        for (int i = 0; i < arr.length; i++) {
+            for (int j = i+1; j < arr.length; j++) {
+                for (int j2 = j+1; j2 < arr.length; j2++) {
+                    if(arr[i]+arr[j]+arr[j2]==x){
+                        s++;
+                    }
+                    
+                }
+            }
+        }
+
+        return s;
+    }
+
+}