Coding-Skills-Arrays - Solutions
Coding-Skills-Arrays - Solutions
Write Java program that checks if two arrays contain the same elements
Ans:
if( a.length!=b.length)
{
System.out.println("Not equal arrays");
System.exit(0);
}
if(!flag1)
{
break;
}
if(!flag2)
{
break;
}
}
}
2. Write Java program that checks if two arrays contain the same no of elements, same
values and same order of elements.
Solution :
boolean flag=true;
for(int i=0; i<a.length;i++)
{
if(a[i]!=b[i])
{
flag = false;
break;
}
}
if(flag)
{
System.out.println("Same");
}
else
{
System.out.println("Not Same");
}
if( a.length!=b.length)
{
System.out.println("Not equal length, can
not swap ");
System.exit(0);
}
a[i] = b[i];
b[i] = temp;
}
}
5 write a program to make reverse of an array .
Solution:
a[i] = a[j];
a[j] = temp;
}
int i = 0;
// i = 6
max1=a[i];
}
if(a[i]>max2 || a[i]<max1)
{
max2 = a[i];
}
}
System.out.println("max1 = "+max1);
System.out.println("max2 = "+max2);
Solution2 :
Using sorting
a[j] = a[j+1];
a[j+1] = temp;
}
}
}
int large2 = a[a.length-1];
break;
}
}
if(a[a.length-1]!=large2)
{
System.out.println("Second Largest number =
"+large2);
}
else
{
System.out.println("Dont have second largest");
}
Solution1 :
package com.tech.mnrao.abc;
min1=a[i];
}
if(a[i]>min1 || a[i]<min2)
{
min2 = a[i];
}
}
System.out.println("min1 = "+min1);
System.out.println("min2 = "+min2);
a[j] = a[j+1];
a[j+1] = temp;
}
}
}
break;
}
}
if(a[a.length-1]!=least2)
{
System.out.println("Second Least number =
"+least2);
}
else
{
System.out.println("Dont have second leasts");
}
int index = 0;
b[index++]=a[0];
if( !flag)
{
b[index++]=a[i];
}
import java.util.Scanner;
a[j] = a[j+1];
a[j+1] = temp;
}
}
}
if(flag)
{
System.out.println( "don't have number less
than your number");
}
int index = 0;
for(int n : a)
{
c[index++]=n;
}
for(int n : b)
{
c[index++]=n;
}
c[j] = c[j+1];
c[j+1] = temp;
}
}
}
for(int n : c)
{
System.out.print(n+" ");
}
}
}
import java.util.Scanner;
int index = 0;
for(int n : a)
{
c[index++]=n;
}
for(int n : b)
{
c[index++]=n;
}
index = 0;
d[index++]=c[0];
if( !flag)
{
d[index++]=c[i];
}
import java.util.Scanner;
int [] a = {15, 5, 13, 18, 31, 35, 29, 44, 22, 55};
if(a.length<b.length)
{
clength = a.length;
}
else
{
clength = b.length;
}
int index = 0;
if(count>1)
{
break;
}
}
for(int i = 0; i<d.length;i++)
{
d[i] = c[i];
}
}
14. write program to remove given element from array.
import java.util.Scanner;
int [] a = {15, 5, 13, 44, 31, 35, 29, 44, 22, 55};
int count = 0;
int index = 0;
}
15.Java program to insert an element at end of an Array.
Ans:
import java.util.Scanner;
int [] a = {15, 5, 13, 44, 31, 35, 29, 44, 22, 55};
int i ;
for(i=0; i<a.length;i++)
{
b[i] = a[i];
}
b[i] = num;
a = b;
}
}
Ans :
import java.util.Scanner;
b[0] = num;
a = b;
import java.util.Scanner;
a = b;
a = b;
if(a[i]>max)
{
max=a[i];
}
if(a[i]<min)
{
min=a[i];
}
System.out.println("max = "+max);
System.out.println("min = "+min);
}
}
20.Write a program in Java to find top two maximum number in
array?
import java.util.Scanner;
a[j] = a[j+1];
a[j+1] = temp;
}
}
}
break;
}
}
if(a[a.length-1]!=large2)
{
System.out.println("First largest number =
"+a[a.length-1]);
import java.util.Scanner;
if(index>a.length-1)
{
System.out.println("given index is not found in
array");
System.exit(0);
}
a = b;