commit

Author: nanawarevishal

3.Array/LeetCode/Program2.java

@@ -0,0 +1,51 @@
+/*
+   
+80. Remove Duplicates from Sorted Array II
+    Example 1:
+    Input: nums = [1,1,1,2,2,3]
+    Output: 5, nums = [1,1,2,2,3,_]
+    Explanation: Your function should return k = 5, with the first five elements of nums being 1, 1, 2, 2 and 3 respectively.
+    It does not matter what you leave beyond the returned k (hence they are underscores).
+
+    Example 2:
+    Input: nums = [0,0,1,1,1,1,2,3,3]
+    Output: 7, nums = [0,0,1,1,2,3,3,_,_]
+    Explanation: Your function should return k = 7, with the first seven elements of nums being 0, 0, 1, 1, 2, 3 and 3 respectively.
+    It does not matter what you leave beyond the returned k (hence they are underscores).
+
+ */
+
+package LeetCode;
+
+public class Program2 {
+    public static void main(String[] args) {
+
+        int nums[] = {0,0,1,1,1,1,2,3,3,3};
+
+        int cnt=0;
+        int ind=1;
+
+        for(int i=1;i<nums.length;i++){
+
+            if(nums[i]==nums[i-1]){
+
+                cnt++;
+            }
+            else{
+                cnt=0;
+            }
+
+            if(cnt <=1){
+                nums[ind] = nums[i];
+                ind++;
+            }
+        }
+        
+
+        for(int i=0;i<nums.length;i++){
+
+            System.out.println(nums[i]+" ");
+        }
+
+    }
+}

3.Array/LeetCode/Program4.java

@@ -0,0 +1,50 @@
+
+/*
+ 215. Kth Largest Element in an Array
+    Medium
+
+    Given an integer array nums and an integer k, return the kth largest element in the array.
+
+    Note that it is the kth largest element in the sorted order, not the kth distinct element.
+
+    You must solve it in O(n) time complexity.
+
+    Example 1:
+    Input: nums = [3,2,1,5,6,4], k = 2
+    Output: 5
+
+    Example 2:
+    Input: nums = [3,2,3,1,2,4,5,5,6], k = 4
+    Output: 4
+ 
+ */
+
+
+package LeetCode;
+
+public class Program4 {
+    public static void main(String[] args) {
+
+        int nums[] = {3,2,3,1,2,4,5,5,6};
+
+        for(int i=0;i<nums.length;i++){
+
+            for(int j=i+1;j<nums.length;j++){
+
+                if(nums[i] > nums[j]){
+
+                    int temp = nums[i];
+                    nums[i] =nums[j];
+                    nums[j] = temp;
+                }
+            }
+        }
+
+        for(int i=0;i<nums.length;i++){
+            System.out.print(nums[i]+" ");
+        }
+
+        
+        
+    }
+}

3.Array/LeetCode/Program5.java

@@ -0,0 +1,92 @@
+/* 
+2562. Find the Array Concatenation Value
+
+    You are given a 0-indexed integer array nums.
+
+    The concatenation of two numbers is the number formed by concatenating their numerals.
+
+    For example, the concatenation of 15, 49 is 1549.
+    The concatenation value of nums is initially equal to 0. Perform this operation until nums becomes empty:
+
+    If there exists more than one number in nums, pick the first element and last element in nums respectively and add the value of their concatenation to the concatenation value of nums, then delete the first and last element from nums.
+    If one element exists, add its value to the concatenation value of nums, then delete it.
+    Return the concatenation value of the nums.
+
+ 
+
+Example 1:
+    Input: nums = [7,52,2,4]
+    Output: 596
+    Explanation: Before performing any operation, nums is [7,52,2,4] and concatenation value is 0.
+    - In the first operation:
+    We pick the first element, 7, and the last element, 4.
+    Their concatenation is 74, and we add it to the concatenation value, so it becomes equal to 74.
+    Then we delete them from nums, so nums becomes equal to [52,2].
+    - In the second operation:
+    We pick the first element, 52, and the last element, 2.
+    Their concatenation is 522, and we add it to the concatenation value, so it becomes equal to 596.
+    Then we delete them from the nums, so nums becomes empty.
+    Since the concatenation value is 596 so the answer is 596.
+
+
+Example 2:
+    Input: nums = [5,14,13,8,12]
+    Output: 673
+    Explanation: Before performing any operation, nums is [5,14,13,8,12] and concatenation value is 0.
+    - In the first operation:
+    We pick the first element, 5, and the last element, 12.
+    Their concatenation is 512, and we add it to the concatenation value, so it becomes equal to 512.
+    Then we delete them from the nums, so nums becomes equal to [14,13,8].
+    - In the second operation:
+    We pick the first element, 14, and the last element, 8.
+    Their concatenation is 148, and we add it to the concatenation value, so it becomes equal to 660.
+    Then we delete them from the nums, so nums becomes equal to [13].
+    - In the third operation:
+    nums has only one element, so we pick 13 and add it to the concatenation value, so it becomes equal to 673.
+    Then we delete it from nums, so nums become empty.
+    Since the concatenation value is 673 so the answer is 673.  
+*/
+
+
+package LeetCode;
+
+
+public class Program5 {
+    public static void main(String[] args) {
+
+        int nums[] = {7,52,2,4};
+        int left = 0;
+        int right = nums.length-1;
+        int sum=0;
+        while(left<=right){
+
+            if(left==right){
+
+                sum += nums[left];
+            }
+
+            else{
+
+                int n = nums[right];
+                int cnt=0;
+
+                while(n!=0){
+                    n/=10;
+                    cnt++;
+                }
+
+                int x =((int) (Math.pow(10, cnt)));
+                sum += nums[left] * x +nums[right];
+
+               
+                
+            }
+            left ++;
+            right--;   
+            
+        }
+        
+        System.out.println(sum+" ");
+ 
+    }
+}

3.Array/LeetCode/program3.java

@@ -0,0 +1,62 @@
+/*
+
+ Write the program to print the distict element from the array.
+
+
+ */
+
+
+package LeetCode;
+
+import java.io.BufferedReader;
+import java.io.InputStreamReader;
+
+public class program3 {
+    public static void main(String[] args)throws Exception {
+
+        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
+
+        int size= Integer.parseInt(br.readLine());
+
+        System.out.println("Enter the size of the array: ");
+        int a[] = new int[size];
+
+        System.out.println("Enter the element of the array: ");
+        for(int i=0;i<a.length;i++){
+
+            a[i] = Integer.parseInt(br.readLine());
+        }
+
+        for(int i=0;i<a.length;i++){
+
+            for(int j=i+1;j<a.length;j++){
+
+                if(a[i] > a[j]){
+
+                    int temp = a[i];
+                    a[i] = a[j];
+                    a[j] = temp;
+                }
+            }
+        }
+
+
+        int i=0;
+        for( i=1;i<=a.length-1;i++){
+
+            if(a[i] !=a[i-1]){
+
+                System.out.print(a[i-1]+" ");
+            }
+        }
+
+
+        if(a[a.length-1]!=a[a.length-2]){
+
+            System.out.print(a[a.length-1]+" end");
+        }
+
+    }
+
+}
+

3.Array/PracticeCodes/Program18.java

@@ -76,7 +76,7 @@ public static void main(String[] args)throws IOException{
 
 		int[] a = new int[size];
 
-		System.out.println("Enter the aay Elements : ");
+		System.out.println("Enter the array Elements : ");
 		for(int i = 0 ; i < size; i++){
 
 			a[i] = Integer.parseInt(br.readLine());

3.Array/PracticeCodes/Program19.java

@@ -0,0 +1,67 @@
+/*
+ Program : Given an array of size N-1 such that it only contains distinct integers 
+ 	      in the range of 1 to N. Find the missing element.
+
+	      Input:
+		N = 5
+		A[] = {1,2,3,5}
+	      Output: 4
+
+	      Input:
+		N = 10
+		A[] = {6,1,2,8,3,4,7,10,5}
+	      Output: 9
+ */
+
+
+package PracticeCodes;
+
+public class Program19 {
+
+    public static void main(String[] args) {
+        
+        int a[] = {6,1,2,8,3,4,7,10,5};
+
+        for(int i=0;i<a.length;i++){
+
+            for(int j=i+1;j<a.length;j++){
+
+                if(a[i] > a[j]){
+
+                    int temp = a[i];
+                    a[i] =a[j];
+                    a[j] = temp;
+                }
+            }
+        }
+
+        for(int x= 0;x<a.length;x++){
+
+            System.out.print(a[x]+" ");
+        }
+
+        int i=0;
+
+        int diff = a[i+1] - a[i];
+
+        boolean flag = false;
+
+        for(int j=0;j<a.length-1;j++){
+
+            if(a[j+1]-a[j]!=diff){
+
+                flag = true;
+
+                System.out.println("The missing element is: "+(a[j]+diff));
+            }
+
+        }
+
+        if(!flag){
+            System.out.println("There is no missing element in array...!");
+        }
+
+
+    }
+    
+}