Scribd
Upload
8 views18 pages

Complete Array All Full Programs

The document contains a collection of Java programs that solve various problems related to arrays, including finding the smallest and largest elements, reversing an array, calculating frequency, and removing duplicates. Each program is structured with user input for array size and elements, followed by the implementation of the specific functionality. The document serves as a comprehensive guide for practicing Java array manipulations.

Uploaded by

tukaramtadmadge2000
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
8 views18 pages

Complete Array All Full Programs

The document contains a collection of Java programs that solve various problems related to arrays, including finding the smallest and largest elements, reversing an array, calculating frequency, and removing duplicates. Each program is structured with user input for array size and elements, followed by the implementation of the specific functionality. The document serves as a comprehensive guide for practicing Java array manipulations.

Uploaded by

tukaramtadmadge2000
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

Complete Java Array Programs (All Problems with

Full Code)

Smallest

import [Link].*;
public class Smallest {
public static void main(String[] args){
Scanner sc=new Scanner([Link]);
[Link]("Enter size: ");
int n=[Link]();
int[] arr=new int[n];
[Link]("Enter elements:");
for(int i=0;i<n;i++) arr[i]=[Link]();

int min=arr[0];
for(int i:arr) if(i<min) min=i;
[Link](min);

[Link]();
}
}
Largest

import [Link].*;
public class Largest {
public static void main(String[] args){
Scanner sc=new Scanner([Link]);
[Link]("Enter size: ");
int n=[Link]();
int[] arr=new int[n];
[Link]("Enter elements:");
for(int i=0;i<n;i++) arr[i]=[Link]();

int max=arr[0];
for(int i:arr) if(i>max) max=i;
[Link](max);

[Link]();
}
}
Second

import [Link].*;
public class Second {
public static void main(String[] args){
Scanner sc=new Scanner([Link]);
[Link]("Enter size: ");
int n=[Link]();
int[] arr=new int[n];
[Link]("Enter elements:");
for(int i=0;i<n;i++) arr[i]=[Link]();

[Link](arr);
[Link](arr[1]);
[Link](arr[n-2]);

[Link]();
}
}
Reverse

import [Link].*;
public class Reverse {
public static void main(String[] args){
Scanner sc=new Scanner([Link]);
[Link]("Enter size: ");
int n=[Link]();
int[] arr=new int[n];
[Link]("Enter elements:");
for(int i=0;i<n;i++) arr[i]=[Link]();

for(int i=n-1;i>=0;i--)
[Link](arr[i]+" ");

[Link]();
}
}
Frequency

import [Link].*;
public class Frequency {
public static void main(String[] args){
Scanner sc=new Scanner([Link]);
[Link]("Enter size: ");
int n=[Link]();
int[] arr=new int[n];
[Link]("Enter elements:");
for(int i=0;i<n;i++) arr[i]=[Link]();

Map<Integer,Integer> map=new HashMap<>();


for(int i:arr) [Link](i,[Link](i,0)+1);
[Link](map);

[Link]();
}
}
Rearrange

import [Link].*;
public class Rearrange {
public static void main(String[] args){
Scanner sc=new Scanner([Link]);
[Link]("Enter size: ");
int n=[Link]();
int[] arr=new int[n];
[Link]("Enter elements:");
for(int i=0;i<n;i++) arr[i]=[Link]();

[Link](arr);
for(int i=0;i<n/2;i++) [Link](arr[i]+" ");
for(int i=n-1;i>=n/2;i--) [Link](arr[i]+" ");

[Link]();
}
}
Sum

import [Link].*;
public class Sum {
public static void main(String[] args){
Scanner sc=new Scanner([Link]);
[Link]("Enter size: ");
int n=[Link]();
int[] arr=new int[n];
[Link]("Enter elements:");
for(int i=0;i<n;i++) arr[i]=[Link]();

int sum=0;
for(int i:arr) sum+=i;
[Link](sum);

[Link]();
}
}
RotateK

import [Link].*;
public class RotateK {
public static void main(String[] args){
Scanner sc=new Scanner([Link]);
[Link]("Enter size: ");
int n=[Link]();
int[] arr=new int[n];
[Link]("Enter elements:");
for(int i=0;i<n;i++) arr[i]=[Link]();

[Link]("Enter k: ");
int k=[Link]();
k=k%n;
for(int i=0;i<k;i++){
int temp=arr[0];
for(int j=0;j<n-1;j++) arr[j]=arr[j+1];
arr[n-1]=temp;
}
[Link]([Link](arr));

[Link]();
}
}
Average

import [Link].*;
public class Average {
public static void main(String[] args){
Scanner sc=new Scanner([Link]);
[Link]("Enter size: ");
int n=[Link]();
int[] arr=new int[n];
[Link]("Enter elements:");
for(int i=0;i<n;i++) arr[i]=[Link]();

int sum=0;
for(int i:arr) sum+=i;
[Link](sum/n);

[Link]();
}
}
Median

import [Link].*;
public class Median {
public static void main(String[] args){
Scanner sc=new Scanner([Link]);
[Link]("Enter size: ");
int n=[Link]();
int[] arr=new int[n];
[Link]("Enter elements:");
for(int i=0;i<n;i++) arr[i]=[Link]();

[Link](arr);
if(n%2==0)
[Link]((arr[n/2]+arr[n/2-1])/2.0);
else
[Link](arr[n/2]);

[Link]();
}
}
RemoveDupSorted

import [Link].*;
public class RemoveDupSorted {
public static void main(String[] args){
Scanner sc=new Scanner([Link]);
[Link]("Enter size: ");
int n=[Link]();
int[] arr=new int[n];
[Link]("Enter elements:");
for(int i=0;i<n;i++) arr[i]=[Link]();

int j=0;
for(int i=0;i<n-1;i++)
if(arr[i]!=arr[i+1]) arr[j++]=arr[i];
arr[j++]=arr[n-1];
for(int i=0;i<j;i++) [Link](arr[i]+" ");

[Link]();
}
}
RemoveDupUnsorted

import [Link].*;
public class RemoveDupUnsorted {
public static void main(String[] args){
Scanner sc=new Scanner([Link]);
[Link]("Enter size: ");
int n=[Link]();
int[] arr=new int[n];
[Link]("Enter elements:");
for(int i=0;i<n;i++) arr[i]=[Link]();

Set<Integer> set=new LinkedHashSet<>();


for(int i:arr) [Link](i);
[Link](set);

[Link]();
}
}
AddElement

import [Link].*;
public class AddElement {
public static void main(String[] args){
Scanner sc=new Scanner([Link]);
[Link]("Enter size: ");
int n=[Link]();
int[] arr=new int[n];
[Link]("Enter elements:");
for(int i=0;i<n;i++) arr[i]=[Link]();

int[] newArr=new int[n+1];


for(int i=0;i<n;i++) newArr[i]=arr[i];
[Link]("Enter new element: ");
newArr[n]=[Link]();
[Link]([Link](newArr));

[Link]();
}
}
Repeating

import [Link].*;
public class Repeating {
public static void main(String[] args){
Scanner sc=new Scanner([Link]);
[Link]("Enter size: ");
int n=[Link]();
int[] arr=new int[n];
[Link]("Enter elements:");
for(int i=0;i<n;i++) arr[i]=[Link]();

for(int i=0;i<n;i++)
for(int j=i+1;j<n;j++)
if(arr[i]==arr[j]) [Link](arr[i]+" ");

[Link]();
}
}
NonRepeating

import [Link].*;
public class NonRepeating {
public static void main(String[] args){
Scanner sc=new Scanner([Link]);
[Link]("Enter size: ");
int n=[Link]();
int[] arr=new int[n];
[Link]("Enter elements:");
for(int i=0;i<n;i++) arr[i]=[Link]();

for(int i=0;i<n;i++){
int count=0;
for(int j=0;j<n;j++)
if(arr[i]==arr[j]) count++;
if(count==1) [Link](arr[i]+" ");
}

[Link]();
}
}
MaxProduct

import [Link].*;
public class MaxProduct {
public static void main(String[] args){
Scanner sc=new Scanner([Link]);
[Link]("Enter size: ");
int n=[Link]();
int[] arr=new int[n];
[Link]("Enter elements:");
for(int i=0;i<n;i++) arr[i]=[Link]();

int max=arr[0],min=arr[0],res=arr[0];
for(int i=1;i<n;i++){
if(arr[i]<0){int t=max;max=min;min=t;}
max=[Link](arr[i],max*arr[i]);
min=[Link](arr[i],min*arr[i]);
res=[Link](res,max);
}
[Link](res);

[Link]();
}
}
Search

import [Link].*;
public class Search {
public static void main(String[] args){
Scanner sc=new Scanner([Link]);
[Link]("Enter size: ");
int n=[Link]();
int[] arr=new int[n];
[Link]("Enter elements:");
for(int i=0;i<n;i++) arr[i]=[Link]();

[Link]("Enter key: ");


int key=[Link]();
for(int i=0;i<n;i++)
if(arr[i]==key){[Link](i);return;}
[Link]("Not Found");

[Link]();
}
}
Subset

import [Link].*;
public class Subset {
public static void main(String[] args){
Scanner sc=new Scanner([Link]);
[Link]("Enter size: ");
int n=[Link]();
int[] arr=new int[n];
[Link]("Enter elements:");
for(int i=0;i<n;i++) arr[i]=[Link]();

int[] b={1,2};
Set<Integer> set=new HashSet<>();
for(int i:arr) [Link](i);
boolean flag=true;
for(int i:b)
if(![Link](i)) flag=false;
[Link](flag);

[Link]();
}
}

You might also like