diff --git a/Arrays/binarysearch.class b/Arrays/binarysearch.class
new file mode 100644
index 0000000..c9bd048
Binary files /dev/null and b/Arrays/binarysearch.class differ
diff --git a/Arrays/binarysearch.java b/Arrays/binarysearch.java
new file mode 100644
index 0000000..e321992
--- /dev/null
+++ b/Arrays/binarysearch.java
@@ -0,0 +1,25 @@
+import java.util.*;
+public class binarysearch {
+    public static int bin(int numbers[],int key){
+        int start=0,end = numbers.length-1;
+        
+        while(start<=end){
+            int mid=(start+end)/2;
+            if(numbers[mid]==key){
+                return mid;
+            }
+            if(numbers[mid]<key){
+                start=mid+1;
+            }
+            else{
+                end=mid-1;
+            }
+        }
+        return -1;
+    }
+    public static void main(String args[]){
+        int numbers[] = {1,2,6,3,5};
+        int key=6;
+        System.out.println("nu is largest : " + bin(numbers,key));
+    }
+}
diff --git a/Arrays/bubblesort.java b/Arrays/bubblesort.java
new file mode 100644
index 0000000..3b9547d
--- /dev/null
+++ b/Arrays/bubblesort.java
@@ -0,0 +1,27 @@
+public class bubblesort {
+    public static void bub(int arr[])
+    {
+        for(int turn=0;turn<arr.length;turn++){
+            for(int j=0;j<arr.length-1-turn;j++){
+                if(arr[j]>arr[j+1]){
+                    int temp=arr[j];
+                    arr[j]=arr[j+1];
+                    arr[j+1]=temp;
+                }
+            }
+        }
+    }
+    public static void printarr(int arr[]){
+        for(int i=0;i<arr.length;i++){
+            System.out.print(arr[i]+" ");
+        }
+        System.out.println();
+    }
+    
+    public static void main(String args[]){
+    int arr[] = {1,4,1,3,2,4,3,7};
+
+    bub(arr);
+    printarr(arr);
+    }
+}
diff --git a/Arrays/countingsort.java b/Arrays/countingsort.java
new file mode 100644
index 0000000..354b469
--- /dev/null
+++ b/Arrays/countingsort.java
@@ -0,0 +1,36 @@
+public class countingsort {
+    public static void printarr(int arr[]){
+        for(int i=0;i<arr.length;i++){
+            System.out.print(arr[i]+" ");
+        }
+        System.out.println();
+    }
+
+    public static void count(int arr[]){
+        int largest=Integer.MIN_VALUE;
+    for(int i=0;i<arr.length;i++){
+        largest=Math.max(largest,arr[i]);
+    }
+             int count[]=new int[largest+1];
+             for(int i=0;i<arr.length;i++){
+                count[arr[i]]++;
+             }
+             //sorting
+             int j=0;
+             for(int i=0;i<count.length;i++){
+                while(count[i]>0){
+                    arr[j]=i;
+                    j++;
+                    count[i]--;
+                }
+    
+             }
+    }
+    
+        public static void main(String args[]){
+        int arr[] = {1,4,1,3,2,4,3,7};
+
+        count(arr);
+        printarr(arr);
+        }
+}
diff --git a/Arrays/eams.class b/Arrays/eams.class
new file mode 100644
index 0000000..fec3f19
Binary files /dev/null and b/Arrays/eams.class differ
diff --git a/Arrays/eams.java b/Arrays/eams.java
new file mode 100644
index 0000000..19d7fcd
--- /dev/null
+++ b/Arrays/eams.java
@@ -0,0 +1,16 @@
+import java.util.*;
+public class eams {
+    public static void update(int marks[]){
+        for( int i=0;i<marks.length;i++){
+            marks[i]= marks[i] + 1;
+        }
+    }
+    public static void main(String args[]){
+        int marks[]={99,98,97};
+        update(marks);
+        for( int i=0;i<marks.length;i++){
+           System.out.print(marks[i] + " ");
+        }
+        System.out.println();
+    }
+}
diff --git a/Arrays/fifa.java b/Arrays/fifa.java
new file mode 100644
index 0000000..f59d136
--- /dev/null
+++ b/Arrays/fifa.java
@@ -0,0 +1,5 @@
+public class fifa {
+    public static void main(String args[]){
+    System.out.print("hello");
+    }
+}
diff --git a/Arrays/hiiii.java b/Arrays/hiiii.java
new file mode 100644
index 0000000..536bc9c
--- /dev/null
+++ b/Arrays/hiiii.java
@@ -0,0 +1,3 @@
+public class hiiii {
+    
+}
diff --git a/Arrays/insertionsort.java b/Arrays/insertionsort.java
new file mode 100644
index 0000000..1b04fee
--- /dev/null
+++ b/Arrays/insertionsort.java
@@ -0,0 +1,26 @@
+public class insertionsort {
+    public static void printarr(int arr[]){
+        for(int i=0;i<arr.length;i++){
+            System.out.print(arr[i]+" ");
+        }
+        System.out.println();
+    }
+    
+public static void insertion(int arr[]){
+    for(int i=1;i<arr.length;i++){
+        int curr=arr[i];
+        int prev=i-1;
+        while(prev>=0 && arr[prev]>curr){
+            arr[prev+1]=arr[prev];
+            prev--;
+        }
+        //insertion
+        arr[prev+1]=curr;
+     }
+}
+    public static void main(String args[]){
+    int arr[] = {1,4,1,3,2,4,3,7};
+    insertion(arr);
+    printarr(arr);
+    }
+}
diff --git a/Arrays/jajmo.java b/Arrays/jajmo.java
new file mode 100644
index 0000000..df98078
--- /dev/null
+++ b/Arrays/jajmo.java
@@ -0,0 +1,3 @@
+public class jajmo {
+    
+}
diff --git a/Arrays/kadanes.java b/Arrays/kadanes.java
new file mode 100644
index 0000000..e133c1e
--- /dev/null
+++ b/Arrays/kadanes.java
@@ -0,0 +1,21 @@
+public class kadanes {
+    public static void kad(int numbers[])
+    {
+        int cs=0;
+        int ms=Integer.MIN_VALUE;
+        for(int i=0; i<numbers.length;i++){
+            cs += numbers[i];
+            if(cs<0){
+                cs=0;
+            }
+            ms=Math.max(cs,ms);
+           
+        }
+
+        System.out.print("maxsubarray sum is :" + ms);
+    }
+    public static void main(String args[]){
+        int numbers[] = {-2,-3,4,-1,-2,1,5,-3};
+        kad(numbers);
+    }
+}
diff --git a/Arrays/lap.java b/Arrays/lap.java
new file mode 100644
index 0000000..e69de29
diff --git a/Arrays/largest.class b/Arrays/largest.class
new file mode 100644
index 0000000..e7070a8
Binary files /dev/null and b/Arrays/largest.class differ
diff --git a/Arrays/largest.java b/Arrays/largest.java
new file mode 100644
index 0000000..9a1ffdd
--- /dev/null
+++ b/Arrays/largest.java
@@ -0,0 +1,20 @@
+import java.util.*;
+public class largest {
+    public static int getlargest(int numbers[]){
+        int largest = Integer.MIN_VALUE;
+        for(int i =0;i<numbers.length;i++){
+            if(largest<numbers[i]){
+
+                largest=numbers[i];
+            }
+        }
+        return largest;
+
+    }
+    public static void main(String args[]){
+        int numbers[] = {1,2,6,3,5};
+        System.out.println("nu is largest : " + getlargest(numbers));
+
+
+    }
+}
diff --git a/Arrays/linearsearch.class b/Arrays/linearsearch.class
new file mode 100644
index 0000000..fb9e241
Binary files /dev/null and b/Arrays/linearsearch.class differ
diff --git a/Arrays/linearsearch.java b/Arrays/linearsearch.java
new file mode 100644
index 0000000..db1ddee
--- /dev/null
+++ b/Arrays/linearsearch.java
@@ -0,0 +1,21 @@
+public class linearsearch {
+    public static int linea(int numbers[],int key){
+        for(int i =0;i<numbers.length;i++){
+            if(numbers[i]==key){
+                return i;
+            }
+        }
+        return -1;
+    }
+    public static void main(String args[]){
+        int numbers[]={2,4,6,8,10,12,14,16};
+        int key=10;
+        int index=linea(numbers,key);
+        if(index==-1){
+            System.out.print("not");
+        }
+        else{
+            System.out.print("key is at index " + index);
+        }
+    }
+}
diff --git a/Arrays/maxsubsum.class b/Arrays/maxsubsum.class
new file mode 100644
index 0000000..e33dcb4
Binary files /dev/null and b/Arrays/maxsubsum.class differ
diff --git a/Arrays/maxsubsum.java b/Arrays/maxsubsum.java
new file mode 100644
index 0000000..46d3ce1
--- /dev/null
+++ b/Arrays/maxsubsum.java
@@ -0,0 +1,29 @@
+public class maxsubsum {
+    public static void sum(int numbers[])
+    {
+        int currsum=0;
+        int maxsum=Integer.MIN_VALUE;
+
+        for(int i =0;i<numbers.length;i++){
+            int start=i;
+            for(int j=i;j<numbers.length;j++){
+                int end=j;
+                currsum=0;
+                for(int k=start;k<=end;k++){
+                    currsum += numbers[k];
+                    }
+                    System.out.println(currsum);
+                    if(maxsum<currsum){
+                        maxsum=currsum;
+                    }
+                
+            }
+            
+        }
+        System.out.print("maxsum" + maxsum);
+    }
+    public static void main(String args[]){
+        int numbers[] = {1,-2,6,-1,3};
+        sum(numbers);
+    }
+}
diff --git a/Arrays/pairs.class b/Arrays/pairs.class
new file mode 100644
index 0000000..422c900
Binary files /dev/null and b/Arrays/pairs.class differ
diff --git a/Arrays/pairs.java b/Arrays/pairs.java
new file mode 100644
index 0000000..4b61721
--- /dev/null
+++ b/Arrays/pairs.java
@@ -0,0 +1,15 @@
+public class pairs {
+    public static void prpai(int numbers[]){
+        for(int i =0;i<numbers.length;i++){
+            int curr=numbers[i];
+            for(int j=i+1;j<numbers.length;j++){
+                System.out.print("(" + curr + "," + numbers[j] + ")");
+            }
+            System.out.println();
+        }
+    }
+    public static void main(String args[]){
+        int numbers[] = {2,4,6,8,10};
+        prpai(numbers);
+    }
+}
diff --git a/Arrays/prefix.class b/Arrays/prefix.class
new file mode 100644
index 0000000..10648c4
Binary files /dev/null and b/Arrays/prefix.class differ
diff --git a/Arrays/prefix.java b/Arrays/prefix.java
new file mode 100644
index 0000000..5fbae3e
--- /dev/null
+++ b/Arrays/prefix.java
@@ -0,0 +1,32 @@
+public class prefix {
+    public static void maxsub(int numbers[])
+    {
+        int currsum=0;
+        int maxsum=Integer.MIN_VALUE;
+        int prefix[]=new int[numbers.length];
+        prefix[0]=numbers[0];
+        for(int i=1; i<prefix.length;i++){
+            prefix[i]=prefix[i-1]+numbers[i];
+        }
+
+        for(int i =0;i<numbers.length;i++){
+            int start=i;
+            for(int j=i;j<numbers.length;j++){
+                int end=j;
+                currsum = start ==0?prefix[end]:prefix[end]-prefix[start-1];
+
+                
+                    if(maxsum<currsum){
+                        maxsum=currsum;
+                    }
+                
+            }
+            
+        }
+        System.out.print("maxsum" +  maxsum);
+    }
+    public static void main(String args[]){
+        int numbers[] = {1,-2,6,-1,3};
+        maxsub(numbers);
+    }
+}
diff --git a/Arrays/reverse.class b/Arrays/reverse.class
new file mode 100644
index 0000000..b358977
Binary files /dev/null and b/Arrays/reverse.class differ
diff --git a/Arrays/reverse.java b/Arrays/reverse.java
new file mode 100644
index 0000000..af3a8fd
--- /dev/null
+++ b/Arrays/reverse.java
@@ -0,0 +1,20 @@
+public class reverse {
+    public static void reve(int numbers[]){
+        int first=0,last = numbers.length-1;
+        while(first<last){
+            int temp=numbers[last];
+            numbers[last]=numbers[first];
+            numbers[first]=temp;
+            first++;
+            last--;
+         }
+    }
+    public static void main(String args[]){
+        int numbers[]={2,4,6,8,10};
+        reve(numbers);
+        for(int i=0;i<numbers.length;i++){
+            System.out.print(numbers[i]+" ");
+        }
+        System.out.println();
+    }
+}
diff --git a/Arrays/selectionsort.java b/Arrays/selectionsort.java
new file mode 100644
index 0000000..b9ad552
--- /dev/null
+++ b/Arrays/selectionsort.java
@@ -0,0 +1,27 @@
+public class selectionsort {
+    public static void printarr(int arr[]){
+        for(int i=0;i<arr.length;i++){
+            System.out.print(arr[i]+" ");
+        }
+        System.out.println();
+    }
+    public static void select(int arr[]){
+        for(int i=0;i<arr.length-1;i++){
+            int minpos=i;
+            for(int j=i+1;j<arr.length;j++){
+                if(arr[minpos]>arr[j]){
+                    minpos=j;
+                }
+            }
+            int temp=arr[minpos];
+                    arr[minpos]=arr[i];
+                    arr[i]=temp;
+        }
+}
+    public static void main(String args[]){
+    int arr[] = {1,4,1,3,2,4,3,7};
+    select(arr);
+    
+    printarr(arr);
+    }
+}
diff --git a/Arrays/sort.java b/Arrays/sort.java
new file mode 100644
index 0000000..868765e
--- /dev/null
+++ b/Arrays/sort.java
@@ -0,0 +1,75 @@
+public class sort {
+    public static void bub(int arr[])
+    {
+        for(int turn=0;turn<arr.length;turn++){
+            for(int j=0;j<arr.length-1-turn;j++){
+                if(arr[j]>arr[j+1]){
+                    int temp=arr[j];
+                    arr[j]=arr[j+1];
+                    arr[j+1]=temp;
+                }
+            }
+        }
+    }
+    public static void printarr(int arr[]){
+        for(int i=0;i<arr.length;i++){
+            System.out.print(arr[i]+" ");
+        }
+        System.out.println();
+    }
+    public static void select(int arr[]){
+        for(int i=0;i<arr.length-1;i++){
+            int minpos=i;
+            for(int j=i+1;j<arr.length;j++){
+                if(arr[minpos]>arr[j]){
+                    minpos=j;
+                }
+            }
+            int temp=arr[minpos];
+                    arr[minpos]=arr[i];
+                    arr[i]=temp;
+        }
+}
+public static void insertion(int arr[]){
+    for(int i=1;i<arr.length;i++){
+        int curr=arr[i];
+        int prev=i-1;
+        while(prev>=0 && arr[prev]>curr){
+            arr[prev+1]=arr[prev];
+            prev--;
+        }
+        //insertion
+        arr[prev+1]=curr;
+
+    }
+}
+public static void count(int arr[]){
+    int largest=Integer.MIN_VALUE;
+for(int i=0;i<arr.length;i++){
+    largest=Math.max(largest,arr[i]);
+}
+         int count[]=new int[largest+1];
+         for(int i=0;i<arr.length;i++){
+            count[arr[i]]++;
+         }
+         //sorting
+         int j=0;
+         for(int i=0;i<count.length;i++){
+            while(count[i]>0){
+                arr[j]=i;
+                j++;
+                count[i]--;
+            }
+
+         }
+}
+
+    public static void main(String args[]){
+    int arr[] = {1,4,1,3,2,4,3,7};
+    //count(arr);
+    //insertion(arr);
+    //select(arr);
+    bub(arr);
+    printarr(arr);
+    }
+}
diff --git a/Arrays/spiral.java b/Arrays/spiral.java
new file mode 100644
index 0000000..fae4499
--- /dev/null
+++ b/Arrays/spiral.java
@@ -0,0 +1,48 @@
+public class spiral {
+    public static void printspiral(int matrix[][]){
+        int startrow=0;
+        int endrow=matrix.length-1;
+        int startcol=0;
+        int endcol=matrix[0].length-1;
+
+        while(startrow<=endrow && startcol<=endcol){
+            //top
+            for(int j=startcol;j<=endcol;j++){
+                System.out.print(matrix[startrow][j]+ " ");
+            }
+
+            //right
+            for(int i=startrow+1;i<=endrow;i++){
+                System.out.print(matrix[i][endcol]+ " ");
+            }
+
+                //bottom
+                for(int j=endcol-1;j>=startcol;j--){
+                    if(startrow==endrow){
+                        break;
+                    }
+                    System.out.print(matrix[endrow][j] + " ");
+                }
+
+                //left
+                for(int i=endrow-1;i>=startrow+1;i--){
+                    if(startcol==endcol){
+                        break;
+                    }
+                    System.out.print(matrix[i][startcol]+ " ");
+                }
+                startcol++;
+                startrow++;
+                endrow--;
+                endcol--;
+            }
+            System.out.println();
+        }
+    public static void main(String args[]){
+        int matrix[][]={{1,2,3,4},
+                       {5,6,7,8},
+                       {9,10,11,12},
+                       {13,14,15,16}};
+        printspiral(matrix);
+    }
+}
diff --git a/Arrays/spiralmatrix.java b/Arrays/spiralmatrix.java
new file mode 100644
index 0000000..2ff06f7
--- /dev/null
+++ b/Arrays/spiralmatrix.java
@@ -0,0 +1,48 @@
+public class spiralmatrix {
+    public static void printspiral(int matrix[][]){
+        int startrow=0;
+        int endrow=matrix.length-1;
+        int startcol=0;
+        int endcol=matrix[0].length-1;
+
+        while(startrow<=endrow && startcol<=endcol){
+            //top
+            for(int j=startcol;j<=endcol;j++){
+                System.out.print(matrix[startrow][j]+ " ");
+            }
+
+            //right
+            for(int i=startrow+1;i<=endrow;i++){
+                System.out.print(matrix[i][endcol]+ " ");
+            }
+
+                //bottom
+                for(int j=endcol-1;j>=startcol;j--){
+                    if(startrow==endrow){
+                        break;
+                    }
+                    System.out.print(matrix[endrow][j] + " ");
+                }
+
+                //left
+                for(int i=endrow-1;i>=startrow+1;i--){
+                    if(startcol==endcol){
+                        break;
+                    }
+                    System.out.print(matrix[i][startcol]+ " ");
+                }
+                startcol++;
+                startrow++;
+                endrow--;
+                endcol--;
+            }
+            System.out.println();
+        }
+    public static void main(string args[]){
+        int matrix[][]={{1,2,3,4},
+                       {5,6,7,8},
+                       {9,10,11,12},
+                       {13,14,15,16}};
+        printspiral(matrix);
+    }
+}
diff --git a/Arrays/stocks.class b/Arrays/stocks.class
new file mode 100644
index 0000000..1bc9dd9
Binary files /dev/null and b/Arrays/stocks.class differ
diff --git a/Arrays/stocks.java b/Arrays/stocks.java
new file mode 100644
index 0000000..04c9b95
--- /dev/null
+++ b/Arrays/stocks.java
@@ -0,0 +1,23 @@
+public class stocks {
+    public static int buyandsellpricestocks(int prices[])
+    {
+        int buyprice=Integer.MAX_VALUE;
+        int maxprofit=0;
+        for(int i=0; i<prices.length;i++){
+            
+            if(buyprice<prices[i]){
+                int profit= prices[i]-buyprice;
+                maxprofit= Math.max(maxprofit,profit);
+            }
+            else{
+                buyprice=prices[i];
+            }
+}
+ return maxprofit;
+    }
+    public static void main(String args[]){
+    int prices[] = {7,1,5,3,6,4};
+    System.out.println(buyandsellpricestocks(prices));
+    }
+    }
+
diff --git a/Arrays/sub.class b/Arrays/sub.class
new file mode 100644
index 0000000..83f5471
Binary files /dev/null and b/Arrays/sub.class differ
diff --git a/Arrays/sub.java b/Arrays/sub.java
new file mode 100644
index 0000000..73ef571
--- /dev/null
+++ b/Arrays/sub.java
@@ -0,0 +1,20 @@
+import java.util.*;
+public class sub {
+    public static void gc(int numbers[]){
+        for(int i =0;i<numbers.length;i++){
+            int start=i;
+            for(int j=i+1;j<numbers.length;j++){
+                int end=j;
+                for(int k=start;k<=end;k++){
+                    System.out.print(numbers[k] + " ");
+                }
+                System.out.println();
+            }
+            System.out.println();
+        }
+    }
+    public static void main(String args[]){
+        int numbers[] = {2,4,6,8,10};
+        gc(numbers);
+    }
+}
diff --git a/Arrays/trap.java b/Arrays/trap.java
new file mode 100644
index 0000000..6de4d6a
--- /dev/null
+++ b/Arrays/trap.java
@@ -0,0 +1,32 @@
+public class trap {
+    public static int Rainwater(int height[]){
+        int n=height.length;
+        //calculate left max boundary -array
+        int leftmax[]= new int[n];
+        leftmax[0]=height[0];
+        for(int i=1; i<n; i++){
+            leftmax[i]=Math.max(height[i],leftmax[i-1]);
+         }
+        //calculate right max boundary -array
+        int rightmax[]= new int[n];
+        rightmax[n-1]=height[n-1];
+        for(int i=n-2;i>=0;i--){
+            rightmax[i]=Math.max(height[i],leftmax[i+1]);
+        }
+        int trappedwat=0;
+
+        //loop
+        for(int i=0;i<n;i++){
+            //water = min(left max bound,right max bound)
+           int watlevel= Math.min(leftmax[i],rightmax[i]);
+           //trapped water = water - height[i]
+           trappedwat += watlevel-height[i];
+    }
+    return trappedwat;
+        }
+        public static void main(String args[]){
+        int height[]={4,2,0,6,3,2,5};
+        System.out.println(Rainwater(height));
+    } 
+}
+