improved readability

Author: wakandarajyam

src/Java/GFG/Missing number in array.java

@@ -1,60 +1,50 @@
-https://practice.geeksforgeeks.org/problems/missing-number-in-array1416/1#
-
-class Solution {
-    int MissingNumber(int array[], int n) {
-        int [] arr = array;
-         long sum =0;  // sum is 10;
-        for(int i =0; i<=n; i++){
-            sum +=i;  // in which doing sum of 1 ,3 4, 5
-        }
-        long sum2  = 0;
-        for(int i=0; i<n-1; i++){
-            sum2+=arr[i]; // in which sum n-1 like 1 , 2, 3 = 6
-        }
-        return (int) (sum-sum2); // 10-6 = 4
-    }
-}
-
-
-
-class Solution {
-    int MissingNumber(int array[], int n) {
-        Arrays.sort(array); // sorting the array starting and ending 
-     for(int i =0; i<array.length; i++){
-         if(array[i] != i+1){ // in this. arr[i] = 3 & i=3 
-        //  and +1   3!=4 then i=3 and +1 return 3+1 =4
-             return i+1;
-         }
-     }
-     return n;
-    }
-}
-
+import java.util.Arrays;
 
+//https://practice.geeksforgeeks.org/problems/missing-number-in-array1416/1#
 
 class Solution {
-    int MissingNumber(int array[], int n) {
-  int sum = (n*(n+1))/2; // 10
-        for(int i=0;i<n-1;i++)
-        {
-            sum -= array[i];
-// 10 -1 , 9-2 , 7 -3 , sum = 4 return 4
-        }
-        return sum;
-    }
+	int missingNumber(int array[], int n) {
+		int[] arr = array;
+		long sum = 0; // sum is 10;
+		
+		for (int i = 0; i <= n; i++) {
+			sum += i; // in which doing sum of 1 ,3 4, 5
+		}
+		
+		long sum2 = 0;
+		for (int i = 0; i < n - 1; i++) {
+			sum2 += arr[i]; // in which sum n-1 like 1 , 2, 3 = 6
+		}
+		return (int) (sum - sum2); // 10-6 = 4
+	}
+
+	int missingNumber2(int array[], int n) {
+		Arrays.sort(array); 
+		for (int i = 0; i < array.length; i++) {
+			if (array[i] != i + 1) { 
+				// in this. arr[i] = 3 & i=3
+				// and +1 3!=4 then i=3 and +1 return 3+1 =4
+				return i + 1;
+			}
+		}
+		return n;
+	}
+
+	int missingNumber3(int array[], int n) {
+		int sum = (n * (n + 1)) / 2; // 10
+		for (int i = 0; i < n - 1; i++) {
+			sum -= array[i];
+			//10 -1 , 9-2 , 7 -3 , sum = 4 return 4
+		}
+		return sum;
+	}
+
+	int missingNumber4(int array[], int n) {
+		Arrays.sort(array);
+		for (int i = 1; i < n; i++) {
+			if (array[i - 1] != i)
+				return i;
+		}
+		return n;
+	}
 }
-
-
-
-
-class Solution {
-    int MissingNumber(int array[], int n) {
- Arrays.sort(array);
-       for(int i=1;i<n;i++){
-           if(array[i-1]!=i) return i;
-       }
-       return n ;
-    }
-}
-
-

src/Java/GFG/Prime Number.java

@@ -1,20 +1,19 @@
-https://practice.geeksforgeeks.org/problems/prime-number2314/0/?category%5B%5D=Mathematical&category%5B%5D=Mathematical&difficulty%5B%5D=-2&difficulty%5B%5D=-1&difficulty%5B%5D=0&page=1&query=category%5B%5DMathematicaldifficulty%5B%5D-2difficulty%5B%5D-1difficulty%5B%5D0page1category%5B%5DMathematical#
+//Question Link: https://practice.geeksforgeeks.org/problems/prime-number2314/0/
+class Solution {
+	static int isPrime(int N) {
+		// code here
+		if (N == 1 || N == 0) {
+			return 0;
+		}
+		if (N == 2) {
+			return 1;
+		}
+		for (int i = 2; i * i <= N; i++) {
+			if (N % i == 0) {
+				return 0;
+			}
+		}
 
-class Solution{
-    static int isPrime(int N){
-        // code here
-    if(N==1 || N==0){
-        return 0;
-    }
-    if(N==2){
-        return 1;
-    }
-    for(int i=2; i*i<=N; i++){
-        if(N%i==0){
-            return 0;
-        }
-    } 
-    
-    return  1;
-    }
-}
+		return 1;
+	}
+}

src/Java/GFG/Second Largest.java

@@ -1,22 +1,27 @@
-
 class Solution {
-    int print2largest(int arr[], int n) {
-        if(n<2){
-            return -1 ;
-        }
-        int max = 0;
-        int sm = 0;
-        for(int i=0; i<n; i++){
-            if(arr[i]>max){
-                sm = max;
-                max = arr[i];
-            }else if(arr[i] >sm  && arr[i] != max){
-                sm = arr[i];
-            }
-        }
-        if(sm == 0){
-            return -1;
-        }
-        return sm;
-    }
+	int printSecondLargestNumber(int arr[], int n) {
+		if (n < 2) {
+			return -1;
+		}
+		int max = 0;
+		int sm = 0;
+		for (int i = 0; i < n; i++) {
+			if (arr[i] > max) {
+				sm = max;
+				max = arr[i];
+			} else if (arr[i] > sm && arr[i] != max) {
+				sm = arr[i];
+			}
+		}
+		if (sm == 0) {
+			return -1;
+		}
+		return sm;
+	}
+
+    //O(N*N)
+    int printSecondLargestNumber2(int arr[], int n) {
+		Arrays.sort(arr);
+		return arr[1];
+	}
 }