Skip to content

Commit 71d1d07

Browse files
curious-vasavicurious-vasavi
committed
Add Dqy 12 medium level array Programs
1 parent 90da9df commit 71d1d07

10 files changed

+655
-0
lines changed

‎src/array_Programming/medium/day_12/AverageOfSmallestAndLargestElement.java‎

Lines changed: 43 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,43 @@
1+
package array_Programming.medium.day_12;
2+
//2. Calculate the average of the largest and smallest elements in an array.
3+
4+
import java.util.Arrays;
5+
import java.util.Scanner;
6+
7+
public class AverageOfSmallestAndLargestElement
8+
{
9+
public static void printAverageOfSmallestAndLarget(int [] arr)
10+
{
11+
int smallest = arr[0];
12+
int largest = arr[0];
13+
for(int i = 1;i<arr.length;i++)
14+
{
15+
if(arr[i] < smallest)
16+
{
17+
smallest = arr[i];
18+
}
19+
if(arr[i]>largest)
20+
{
21+
largest = arr[i];
22+
}
23+
System.out.println("Smallest element :"+smallest);
24+
System.out.println("Largest element :"+largest);
25+
System.out.println("Average of smallest and largest :"+((smallest+largest)/2));
26+
}
27+
}
28+
public static void main(String[] args)
29+
{
30+
Scanner sc = new Scanner(System.in);
31+
System.out.println("Enter the size of the array :");
32+
int size = sc.nextInt();
33+
int [] arr = new int [size];
34+
System.out.println("Enter "+size + " elements :");
35+
for(int i = 0;i<=arr.length-1;i++)
36+
{
37+
arr[i]= sc.nextInt();
38+
}
39+
System.out.println("Array :"+Arrays.toString(arr));
40+
printAverageOfSmallestAndLarget(arr);
41+
sc.close();
42+
}
43+
}

‎src/array_Programming/medium/day_12/DifferenceOfSmallestAndLargest.java‎

Lines changed: 44 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,44 @@
1+
package array_Programming.medium.day_12;
2+
3+
import java.util.Arrays;
4+
import java.util.Scanner;
5+
6+
//3. Calculate the difference between the largest and smallest elements in an array.
7+
public class DifferenceOfSmallestAndLargest
8+
{
9+
public static void printDifferenceOfSmallestAndLargest(int [] arr)
10+
{
11+
int smallest = arr[0];
12+
int largest = arr[0];
13+
14+
for(int i = 1;i<arr.length;i++)
15+
{
16+
if(arr[i]<smallest)
17+
{
18+
smallest =arr[i];
19+
}
20+
if(arr[i]>largest)
21+
{
22+
largest = arr[i];
23+
}
24+
}
25+
System.out.println("Smallest element :"+smallest);
26+
System.out.println("Largest element :"+largest);
27+
System.out.println("Difference of smallest and largest :"+(largest-smallest));
28+
}
29+
public static void main(String[] args)
30+
{
31+
Scanner sc = new Scanner(System.in);
32+
System.out.println("Enter the size of the array :");
33+
int size = sc.nextInt();
34+
int [] arr= new int[size];
35+
System.out.println("Enter "+size+" elements :");
36+
for(int i = 0;i<=arr.length-1;i++)
37+
{
38+
arr[i] = sc.nextInt();
39+
}
40+
System.out.println("Array :"+Arrays.toString(arr));
41+
printDifferenceOfSmallestAndLargest(arr);
42+
sc.close();
43+
}
44+
}

‎src/array_Programming/medium/day_12/LeftRotateArrayInGivenSteps.java‎

Lines changed: 61 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,61 @@
1+
package array_Programming.medium.day_12;
2+
//10. Write a Java program to rotate an array to the left by a given number of steps.
3+
import java.util.Arrays;
4+
import java.util.Scanner;
5+
public class LeftRotateArrayInGivenSteps
6+
{
7+
public static void leftRotate(int[] arr, int k)
8+
{
9+
int n = arr.length;
10+
11+
k = k % n;
12+
13+
int[] temp = new int[n];
14+
int index = 0;
15+
16+
for (int i = k; i < n; i++)
17+
{
18+
temp[index++] = arr[i];
19+
}
20+
21+
for (int i = 0; i < k; i++)
22+
{
23+
temp[index++] = arr[i];
24+
}
25+
26+
for (int i = 0; i < n; i++)
27+
{
28+
arr[i] = temp[i];
29+
}
30+
}
31+
32+
public static void main(String[] args)
33+
{
34+
Scanner sc = new Scanner(System.in);
35+
36+
System.out.println("Enter the size of the array:");
37+
int size = sc.nextInt();
38+
39+
int[] arr = new int[size];
40+
41+
System.out.println("Enter " + size + " elements:");
42+
for (int i = 0; i < arr.length; i++)
43+
{
44+
arr[i] = sc.nextInt();
45+
}
46+
47+
System.out.println("Enter number of left rotations:");
48+
int k = sc.nextInt();
49+
50+
System.out.println("Original array: " + Arrays.toString(arr));
51+
52+
leftRotate(arr, k);
53+
54+
System.out.println("Array after left rotation: " + Arrays.toString(arr));
55+
56+
sc.close();
57+
}
58+
}
59+
60+
61+

‎src/array_Programming/medium/day_12/MergeEvenElementsReverse.java‎

Lines changed: 72 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,72 @@
1+
package array_Programming.medium.day_12;
2+
//4. Merge only the even elements from two arrays into a single array and print it in reverse
3+
4+
import java.util.Arrays;
5+
import java.util.Scanner;
6+
7+
public class MergeEvenElementsReverse
8+
{
9+
public static int countEven(int arr[])
10+
{
11+
int count = 0;
12+
for(int i = 0;i<=arr.length-1;i++)
13+
{
14+
if(arr[i]%2==0)
15+
count++;
16+
}
17+
return count;
18+
}
19+
public static int[] mergeEvenElements(int [] arr1,int [] arr2)
20+
{
21+
int size = countEven(arr1)+countEven(arr2);
22+
int [] merged = new int[size];
23+
int index = 0;
24+
25+
for(int i = 0;i<arr1.length;i++)
26+
{
27+
if(arr1[i]%2==0)
28+
merged[index++] = arr1[i];
29+
}
30+
for(int i = 0;i<arr2.length;i++)
31+
{
32+
if(arr2[i]%2==0)
33+
merged[index++]=arr2[i];
34+
}
35+
return merged;
36+
}
37+
public static void printReverse(int [] arr)
38+
{
39+
System.out.println("Merged even elements in reverse order : ");
40+
for(int i = arr.length-1;i>=0;i--)
41+
{
42+
System.out.println(arr[i]+" ");
43+
}
44+
}
45+
public static void main(String[] args)
46+
{
47+
Scanner sc = new Scanner(System.in);
48+
System.out.println("Enter the size of the first array :");
49+
int n1 =sc.nextInt();
50+
int [] arr1 = new int[n1];
51+
System.out.println("Enter "+ n1 + " elements :");
52+
for(int i = 0;i<=arr1.length-1;i++)
53+
{
54+
arr1[i] = sc.nextInt();
55+
}
56+
System.out.println("Array : "+Arrays.toString(arr1));
57+
58+
System.out.println("Enter the size of the second array :");
59+
int n2 = sc.nextInt();
60+
int [] arr2 = new int [n2];
61+
System.out.println("Enter "+n2 + "elements :");
62+
for(int i = 0;i<=arr2.length-1;i++)
63+
{
64+
arr2[i] = sc.nextInt();
65+
}
66+
System.out.println("Array :"+Arrays.toString(arr2));
67+
68+
int [] mergedEvenElements = mergeEvenElements(arr1, arr2);
69+
printReverse(mergedEvenElements);
70+
sc.close();
71+
}
72+
}

‎src/array_Programming/medium/day_12/MergeSmallestAndLargest.java‎

Lines changed: 83 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,83 @@
1+
package array_Programming.medium.day_12;
2+
//7. Merge the largest and smallest elements from two arrays into a single array.
3+
4+
import java.util.Scanner;
5+
6+
public class MergeSmallestAndLargest
7+
{
8+
public static int findSmallest(int [] arr)
9+
{
10+
int smallest = arr[0];
11+
for(int i = 1;i<arr.length;i++)
12+
{
13+
if(arr[i] < smallest)
14+
smallest = arr[i];
15+
}
16+
return smallest;
17+
}
18+
19+
public static int findLargest(int [] arr)
20+
{
21+
int largest = arr[0];
22+
for(int i = 1;i<arr.length;i++)
23+
{
24+
if(arr[i]>largest)
25+
largest = arr[i];
26+
}
27+
return largest;
28+
}
29+
30+
public static int[] mergeSmallestAndLargest(int [] arr1 , int [] arr2)
31+
{
32+
int [] result = new int[4];
33+
34+
result[0] = findSmallest(arr1);
35+
result[1] = findLargest(arr1);
36+
result[2] = findSmallest(arr2);
37+
result[3] = findLargest(arr2);
38+
39+
return result;
40+
}
41+
42+
public static void printArray(int[] arr)
43+
{
44+
System.out.print("Merged smallest and largest elements: ");
45+
for (int i = 0; i < arr.length; i++)
46+
{
47+
System.out.print(arr[i] + " ");
48+
}
49+
System.out.println();
50+
}
51+
52+
public static void main(String[] args)
53+
{
54+
Scanner sc = new Scanner(System.in);
55+
56+
System.out.println("Enter size of first array:");
57+
int n1 = sc.nextInt();
58+
int[] arr1 = new int[n1];
59+
60+
System.out.println("Enter elements of first array:");
61+
for (int i = 0; i < arr1.length; i++)
62+
{
63+
arr1[i] = sc.nextInt();
64+
}
65+
66+
System.out.println("Enter size of second array:");
67+
int n2 = sc.nextInt();
68+
int[] arr2 = new int[n2];
69+
70+
System.out.println("Enter elements of second array:");
71+
for (int i = 0; i < arr2.length; i++)
72+
{
73+
arr2[i] = sc.nextInt();
74+
}
75+
76+
int[] merged = mergeSmallestAndLargest(arr1, arr2);
77+
printArray(merged);
78+
79+
sc.close();
80+
}
81+
}
82+
83+

‎src/array_Programming/medium/day_12/MultiplicationOfSmallestAndLargestElement.java‎

Lines changed: 42 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,42 @@
1+
package array_Programming.medium.day_12;
2+
import java.util.Arrays;
3+
import java.util.Scanner;
4+
//1. Calculate the multiplication of the largest and smallest elements in an array.
5+
public class MultiplicationOfSmallestAndLargestElement
6+
{
7+
public static void printMultiplicationOfSmallestAndLargest(int arr[])
8+
{
9+
int smallest = arr[0];
10+
int largest = arr[0];
11+
12+
for(int i = 1;i<arr.length;i++)
13+
{
14+
if(arr[i] < smallest)
15+
{
16+
smallest = arr[i];
17+
}
18+
if(arr[i]>largest)
19+
{
20+
largest = arr[i];
21+
}
22+
}
23+
System.out.println("Smallest element : "+ smallest);
24+
System.out.println("Largest element : "+largest);
25+
System.out.println("Multiplication of smallest and largest element is "+(smallest * largest));
26+
}
27+
public static void main(String[] args) {
28+
Scanner sc = new Scanner(System.in);
29+
System.out.println("Enter the size of the array : ");
30+
int size = sc.nextInt();
31+
int [] arr = new int[size];
32+
System.out.println("Enter "+size + " elements : ");
33+
for(int i = 0;i<=arr.length-1;i++)
34+
{
35+
arr[i] = sc.nextInt();
36+
}
37+
System.out.println("Array : "+ Arrays.toString(arr));
38+
printMultiplicationOfSmallestAndLargest(arr);
39+
sc.close();
40+
}
41+
42+
}

0 commit comments

Comments
 (0)