@@ -0,0 +1,30 @@
+
+public class Function_Overloading {
+
+    public static void num_cal(int num, char ch){   
+          if (ch=='s')
+          System.out.println(num*num);
+          else
+          System.out.println(num*num*num);
+    }
+    public static void num_cal(int a,int b, char ch){
+        if (ch=='p')
+        System.out.println(a*b);
+        else
+        System.out.println(a+b);  
+    }
+    public static void num_cal(char a, char b){
+          if (a==b)
+          System.out.println("Same Characters");
+          else 
+          System.out.println("Different Characters");
+    }
+    
+   public static void main (String[]args) {
+    
+       num_cal(4,'s');
+       num_cal(5,6,'p');
+       num_cal('c','c');
+ 
+   }
+}
@@ -0,0 +1,43 @@
+import java.util.Scanner;
+ 
+public class PeakFinder {
+
+  public static void findPeak(int array[], int len) {
+    int peak[] = new int[len];
+    for (int i = 1, j = 0; i < (array.length - 1); i++) { // 1 to 1 less than the length of the array
+      if (array[i] > array[i + 1] &&  array[i] > array[i - 1] ) {
+        peak[j] = array[i];
+        j++;
+      }
+      if (array[0] > array[1] ) {
+        int peakStart = array[0];
+        System.out.println(peakStart);
+      }
+    }
+    for (int k = 0; k < peak.length; k++) {
+       if (peak[k]!=0) // blank indexes in dynamic array are not printed
+        System.out.println(peak[k]); 
+      }
+
+      if (array[array.length-1] > array[array.length -2]) {
+        int peakEnd = array[array.length-1];
+        System.out.println(peakEnd);
+      }
+  } 
+
+  public static void main(String[] args) {
+    Scanner sc = new Scanner(System.in);
+    System.out.println("Enter Number of elements in an array");
+    int len = sc.nextInt();
+    int array[] = new int[len];
+    System.out.println("Enter elements");
+    for (int i = 0; i < len; i++) {
+      array[i] = sc.nextInt();
+    }
+
+     findPeak(array, len);
+
+     sc.close();
+  }
+
+}
@@ -0,0 +1,29 @@
+import java.util.Scanner;
+public class SeriesSumConflict {
+      // Same answer
+     public static int SumSeries1(){   // Mine
+         int s=0,prod=1;
+         for (int i=1;i<=20;i++){
+             prod*=i;
+             s+=prod;
+         }
+        return s;
+     }
+     public static int SumSeries2(){  // Ma'am's
+        int s=0,f=1;
+        for (int i=1;i<=20;i++){
+             f=1;
+        for (int j=1;j<=i;j++){     
+            f*=j;
+        }
+        s+=f;
+      }
+      return s;
+    }
+   public static void main (String[]args) {
+      Scanner sc = new Scanner(System.in);
+      System.out.println(SumSeries1());
+      System.out.println(SumSeries2());
+      sc.close();  
+   }
+}
@@ -0,0 +1,25 @@
+import java.util.Scanner;
+
+public class vowelCount {
+
+    public static int vowelCalc (String string){
+      int  vowelCounter=0;
+      String vowels="";
+       for (int i=0;i<string.length();i++){
+       if (string.charAt(i)=='a'||string.charAt(i)=='e'||string.charAt(i)=='i'||string.charAt(i)=='o'||string.charAt(i)=='u'){
+         vowelCounter++;     
+         vowels=vowels+string.charAt(i)+" ";
+       }
+       
+      }
+       System.out.println("Vowels in the string : "+vowels);  
+       return vowelCounter;
+    }
+   public static void main (String[]args) {
+      Scanner sc = new Scanner(System.in);
+      System.out.println("Enter a string");
+      String string = sc.nextLine();
+      System.out.println(vowelCalc(string));
+      sc.close();  
+   }
+}