I am neo java week 4

 

Skill builder

1. Ramu, the math teacher have entered the marks of the students in the excel sheet

import java.util.*; import java.lang.*; import java.io.*; class Main { public static void main(String[] a) throws Exception { Scanner input = new Scanner(System. in); int number_of_elements = input. nextInt(); if (number_of_elements <= 0) return; int array[] = new int[number_of_elements]; for (int ctr = 0; ctr < number_of_elements; ctr++) { array[ctr] = input. nextInt(); } System.out.println("Original arraay:"); System.out.println(Arrays.toString(array)); rotate_array(array); System.out.println("Rotated arraay:"); System.out.println(Arrays.toString(array)); } static void rotate_array(int arr[]) { int a = arr[arr.length-1], i; for (i = arr.length-1; i > 0; i--) arr[i] = arr[i-1]; arr[0] = a; } }

2. Given an array A consists of N number of elements.If the sum of the element is "even" print the sum of the element.

import java.util.Scanner; class Main { public static void main(String args[]) { int n; Scanner in = new Scanner(System.in); n = in.nextInt(); int i; int[] array = new int[n]; for (i = 0; i < n; i++) array[i] = in.nextInt(); int sum = 0, mul = 1; for (int num : array) { sum = sum + num; mul = mul * num; } i = (sum % 2 == 0) ? sum : mul; System.out.println(i); } }

3. Write a program to read two arrays of integer from the user and find the common elements between the two arrays.

import java.io.*; import java.util.*; class Main { public static void main(String [] args) { int m,n,i,j; Scanner sc = new Scanner(System.in); m = sc.nextInt(); n = sc.nextInt(); int arr1 [] = new int[m]; int arr2 [] = new int[n]; for(i=0;i<m;i++) arr1[i] = sc.nextInt(); for(j=0;j<n;j++) arr2[j] = sc.nextInt(); for(i=0;i<m;i++) { for(j=0;j<n;j++) { if(arr1[i] == arr2[j]) System.out.println(arr1[i]); }}}}

4. Write a program to find all pairs of elements in an array whose sum is equal to the given value

import java.util.Scanner; class PairOfInt { static void pairs_value(int inputArray[], int inputNumber) { for (int i = 0; i < inputArray.length; i++) { for (int j = i+1; j < inputArray.length; j++) { if(inputArray[i]+inputArray[j] == inputNumber) { System.out.println(inputArray[i]+" + "+inputArray[j]+" = "+inputNumber); } } } } public static void main(String[] args) { Scanner myObj = new Scanner(System.in); int sum = myObj.nextInt(); int n = myObj.nextInt(); int array1[]; array1 =new int[n]; for(int i=0;i<n;i++) array1[i]=myObj.nextInt(); pairs_value(array1, sum); } }

5. Write a program to obtain an array and print the array elements dropping the minimum element.

import java.util.*; import java.lang.*; import java.io.*; class Q01Simple1DArray { public static void main (String[] args) throws java.lang.Exception { Scanner input = new Scanner(System. in); int number_of_elements = input. nextInt(); if (number_of_elements <= 0) return; int numbers[] = new int[number_of_elements]; int min = Integer.MAX_VALUE; for (int ctr = 0; ctr < number_of_elements; ctr++) { numbers[ctr] = input. nextInt(); if (min > numbers[ctr]) min = numbers[ctr]; } for (int ctr = 0; ctr < number_of_elements; ctr++) { if (min != numbers[ctr]) System.out.print(numbers[ctr] + " "); } } }

6. Write a program to delete an element from the array.

import java.util.Scanner; class Delete { public static void main(String[] args) { int n, x, flag = 1, loc = 0; Scanner s = new Scanner(System.in); n = s.nextInt(); int a[] = new int[n]; for (int i = 0; i < n; i++) { a[i] = s.nextInt(); } x = s.nextInt(); for (int i = 0; i < n; i++) { if(a[i] == x) { flag =1; loc = i; break; } else { flag = 0; } } if(flag == 1) { for(int i = loc+1; i < n; i++) { a[i-1] = a[i]; } for (int i = 0; i < n-2; i++) { System.out.print(a[i]+" "); } System.out.print(a[n-2]); } }}

7. Given a positive integer n and an array of elements,

import java.io.*; import java.util.*; class Main { public static void main(String [] args) { int i,n; Scanner sc = new Scanner(System.in); n = sc.nextInt(); int [] arr = new int[n]; for(i=0;i<n;i++) { arr[i] = sc.nextInt(); } for(i=0;i<n;i++) { if(arr[i]%15 == 0) { System.out.print("FizzBuzz"+" "); } else if(arr[i]%5 == 0) { System.out.print("Buzz"+" "); } else if(arr[i]%3 == 0) { System.out.print("Fizz"+" "); } else { System.out.print(arr[i]+" "); } } } }

8. Write a program that passes an array as a parameter to a function named secLarge() that returns the second largest element in the array.

import java.io.*; import java.util.*; class secondLargest { public static void secLarge(int arr[],int n) { Arrays.sort(arr); System.out.println(arr[n-2]); } public static void main(String [] args) { int i,n; Scanner sc = new Scanner(System.in); n = sc.nextInt(); int arr[] = new int[n]; for(i=0;i<n;i++) { arr[i] = sc.nextInt(); } secLarge(arr,n); } }

9. Given an array of N integers. Write a Java program to find the maximum absolute difference between any two elements of the array. 

import java.util.Scanner; class Diff { static int maxAbsDiff(int arr[], int n) { int minEle = arr[0]; int maxEle = arr[0]; for (int i = 1; i < n; i++) { minEle = Math.min(minEle, arr[i]); maxEle = Math.max(maxEle, arr[i]); } return (maxEle - minEle); } // Driver code public static void main(String[] args) { Scanner in = new Scanner(System.in); int n = in.nextInt(); int[] arr = new int[n]; for(int i = 0;i<n;i++) arr[i] = in.nextInt(); System.out.print(maxAbsDiff(arr, n)); } }

10. Siva is a math teacher...

import java.util.*; import java.lang.*; import java.io.*; class Main { public static void main(String[] a) throws Exception { Scanner input = new Scanner(System. in); int number_of_elements = input. nextInt(); if (number_of_elements <= 0) return; int array[] = new int[number_of_elements]; for (int ctr = 0; ctr < number_of_elements; ctr++) { array[ctr] = input. nextInt(); if (array[ctr] != 0 && array[ctr] != 1) { System.err.println("Invalid input, exiting."); throw new Exception("Invalid Input"); } } separate0and1(array, number_of_elements); for(int i = 0 ; i < number_of_elements; i++) { System.out.print(array[i] + " "); } } static void separate0and1(int array[], int size) { int left = 0, right = size-1; while (left < right) { while (array[left] == 0 && left < right) left++; while (array[right] == 1 && left < right) right--; if (left < right) { array[left] = 0; array[right] = 1; left++; right--; } } }}

Challange yourself

1. Weighing machines in Sunrise Logistics is not working.

import java.util.Scanner; class SumDemo{ public static void main(String args[]){ int count; int sum; sum=0; Scanner scan = new Scanner(System.in); count = scan.nextInt(); int array[] = new int[count]; for (int i = 0; i < count; i++) { array[i] = scan.nextInt(); } scan.close(); for( int num : array) { sum = sum+num; } System.out.println(sum); }}

2. Write a program to insert an element at a specified position in the array and find the duplicate values of the array of float values.

import java.io.*; import java.util.*; class main { public static void main(String [] args) { int i,j,n,pos,ele; Scanner sc = new Scanner(System.in); n = sc.nextInt(); double arr[] = new double[n+1]; for(i=0;i<n;i++) { arr[i] = sc.nextDouble(); } pos = sc.nextInt(); ele = sc.nextInt(); n++; for (i = n-1; i >= pos; i--) { arr[i] = arr[i - 1]; } arr[pos - 1] = ele; for(i=0;i<n;i++) { System.out.print(arr[i]+" "); } System.out.println(); for(i=0;i<n;i++) { for(j=i+1;j<n;j++) { if(arr[i] == arr[j]) { System.out.println(arr[j]); }}}}}

3. Find largest and smallest number in an array in java without sorting them.

import java.util.Scanner; class Large_Small{ public static void main (String args[]) { Scanner scan=new Scanner(System.in); int min,max; int n=scan.nextInt();//get input from user for array length int arr[]=new int[n]; //declaring an array of n elements //for loop takes input from user for(int i=0; i<n; i++){ arr[i]=scan.nextInt();//takes input from user for array } min=arr[0];//assume first element as smallest value max=arr[0];//assume first element as largest value for(int i=0; i<n; i++){ if(min>arr[i]){//loop for find minimum elements min=arr[i]; } if(max<arr[i]){ max=arr[i]; //loop for find maximum elements } } System.out.print("smallest value: "+min); System.out.print("\nlargest value: "+max); } }

4. Write a program to find the first and last occurrence of an element in a sorted array.

import java.io.*; import java.util.*; class Main { public static void findFirstAndLast(int arr[], int x) { int n = arr.length; int first = -1, last = -1; for (int i = 0; i < n; i++) { if (x != arr[i]) continue; if (first == -1) first = i; last = i; } if (first != -1) { System.out.println(first+" "+last); } else System.out.println("Not Found"); } public static void main(String[] args) { int i,n,x; Scanner sc = new Scanner(System.in); n = sc.nextInt(); int arr[] = new int[n]; for(i=0;i<n;i++) { arr[i] = sc.nextInt(); } x = sc.nextInt(); findFirstAndLast(arr, x); }}

5. Given an unsorted array of unique integers in the range from 1 to N+1. Find the missing element in the array without sorting the array.

import java.util.*; class Main { public static void main(String[] args) { int sum = 0; int idx = -1; int num; Scanner sc=new Scanner(System.in); num=sc.nextInt(); int arr[]=new int[num]; for(int i=0;i<num;i++) { arr[i]=sc.nextInt(); sum += arr[i]; } int total = (num+2)*(num+1)/ 2; System.out.println("" + (total - sum)); }}