Add files via upload

Author: shatakshigarg

TIME COMPLEXITY/ARRAY EQUILIBRIUM INDEX.txt

@@ -0,0 +1,22 @@
+public class Solution {
+
+	public static int arrayEquilibriumIndex(int[] arr){  
+		//Your code goes here
+        int n =arr.length;
+         int i, j;
+        int leftsum, rightsum;
+  
+        for (i = 0; i < n; ++i) {
+            leftsum = 0;  
+            for (j = 0; j < i; j++)
+                leftsum += arr[j];
+            rightsum = 0;
+            for (j = i + 1; j < n; j++)
+                rightsum += arr[j];
+            if (leftsum == rightsum)
+                return i;
+        }
+  
+        return -1;
+	}
+}

TIME COMPLEXITY/ARRAY INTERSECTION.txt

@@ -0,0 +1,31 @@
+import java.util.*;
+public class Solution {
+
+	public static void intersection(int[] arr1, int[] arr2) {
+	    //Your code goes here
+        Arrays.sort(arr1);
+        Arrays.sort(arr2);
+        merge(arr1,arr2);
+        
+	}
+    
+    private static void merge(int []arr1,int []arr2){
+        int m=arr1.length;
+        int n=arr2.length;
+        int i=0;
+        int j=0;
+        while(i<m && j<n){
+            if(arr1[i]==arr2[n]){
+                System.out.print(arr1[i]+" ");
+                i++;
+                j++;
+            }
+            else if(arr1[i]<arr2[j]){
+                i++;
+            }else{
+                j++;
+            }
+            
+        }
+    }
+	

TIME COMPLEXITY/DUPLICATE IN ARRAY.txt

@@ -0,0 +1,13 @@
+public class Solution {
+
+	public static int findDuplicate(int[] arr) {
+		//Your code goes here
+         int n = arr.length-2;
+        int sum = 0;
+        for(int i : arr){
+            sum+=i;
+        }
+        
+        return (sum - ((n*(n+1))/2));
+	}
+}

TIME COMPLEXITY/FIND THE UNIQUE ELEMENT.txt

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

TIME COMPLEXITY/PAIR SUM IN ARRAY.txt

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

TIME COMPLEXITY/TRIPLET SUM.txt

@@ -0,0 +1,96 @@
+// public class Solution {	
+
+//     public static int tripletSum(int[] arr, int num) {
+//         int count=0;
+//         //Your code goes here
+//         //  public static void FindTriplet(int[] arr, int x){
+//         for(int i=0;i<arr.length;i++)
+//         {                              
+//             for(int j=i+1;j<arr.length;j++)
+//             {
+//                 for(int k=j+1;k<arr.length;k++)
+//                 {             
+
+//                     if(arr[i]+arr[j]+arr[k]==sum){
+//                         count++;
+//                         if(arr[i]<=arr[j] && arr[i]<=arr[k]){
+
+//                             System.out.print(arr[i]+" ");
+//                             if (arr[j]<=arr[k])
+//                                 System.out.println(arr[j]+" "+arr[k]);
+//                             else
+//                                 System.out.println(arr[k]+" "+arr[j]);
+
+
+//                         }
+//                         else
+//                             if(arr[j]<=arr[i] && arr[j]<=arr[k]){
+
+//                                 System.out.print(arr[j]+" ");
+//                                 if (arr[i]<=arr[k])
+//                                     System.out.println(arr[i]+" "+arr[k]);
+//                                 else
+//                                     System.out.println(arr[k]+" "+arr[i]);
+
+//                             }
+
+//                         else{
+
+
+//                             System.out.print(arr[k]+" ");
+//                             if (arr[i]<=arr[j])
+//                                 System.out.println(arr[i]+" "+arr[j]);
+//                             else
+//                                 System.out.println(arr[j]+" "+arr[i]);
+
+//                         }
+
+
+
+//                     }
+//                 }
+//             }
+
+
+//         }
+
+
+
+//     }
+// }
+
+
+import java.util.Arrays;
+public class Solution {	
+    public static int tripletSum(int[] arr, int num) {
+        //Your code goes here
+        Arrays.sort(arr);
+        int l=arr.length;
+        int count=0;
+        for(int i=0;i<l-3;i++)
+        {
+            int j=i+1;
+            int k=l-1;
+            while(j<k)
+            {
+                if(arr[i]+arr[j]+arr[k]==num)
+                {
+                    for(int d=k;d>j;d--)
+                    {
+                        if(arr[i]+arr[j]+arr[d]==num)
+                        {
+                            count++;
+                        }
+                    }
+                    j++;
+                }
+                else if(arr[i]+arr[j]+arr[k]<num)
+                {
+                    j++;
+                }
+                else k--;
+            }
+        }
+        return count;
+    }
+}