Index

1-Array .
2-Function .
3-Number(such as
palindrome).
4-Series.
5-String.

Introduction
JAVA was developed by Sun Microsystems Inc in 1991, later
acquired by Oracle Corporation. It was developed by James
Gosling and Patrick Naughton. It is a simple programming
language. Writing, compiling and debugging a program is easy in
java. It helps to create modular programs and reusable code.

JAVA-Features
 Object Oriented. In Java, everything is an Object. ...
 Platform Independent. Unlike many other programming
languages including C and C++, when Java is compiled, it is
not compiled into platform specific machine, rather into
platform-independent byte code.
 Simple.
 Secure.
 Architecture-neutral.
 Portable.
 Robust.
 Multithreaded.

import java.util.*;

class Selection_sort_string

{ public static void main(String args[])

{ Scanner sc=new Scanner(System.in);

int i=0,j=0;

for(i=0;i<10;i++)

s[i]=sc.next();

for(i=0;i<10;i++)

{ for(j=(i+1);j<10;j++)

{ if(s[i].compareTo(s[j])>0)

{ temp=s[j];

s[j]=s[i];

s[i]=temp;

for(i=0;i<10;i++)

System.out.println(s[i]);

import java.util.*;
class Bubble_sort
{ public static void main(String args[])
{ Scanner sc=new Scanner(System.in);
 int s[]=new int[10],temp=0;
int i=0,j=0;
for(i=0;i<10;i++)
s[i]=sc.nextInt();
for(i=0;i<10;i++)
{ for(j=0;j<(10-i-1);j++)
{ if(s[j]>s[j+1])
{ temp=s[j];
s[j]=s[i];
s[i]=temp;
}
}
}
for(i=0;i<10;i++)
System.out.println(s[i]);
}
}

3
import java.util.*;

class Bubble_sort

{ public static void main(String args[])

{ Scanner sc=new Scanner(System.in);

int s[]=new int[10],temp=0;

for(i=0;i<10;i++)

s[i]=sc.nextInt();

for(i=0;i<10;i++)

{ for(j=0;j<(10-i-1);j++)

{ if(s[j]>s[j+1])

{ temp=s[j];

s[j]=s[i];

s[i]=temp;

for(i=0;i<10;i++)

System.out.println(s[i]);

4
import java.util.*;

class Binary_search

{ public static void main(String args[])

{ Scanner sc=new Scanner(System.in);

System.out.println("Enter 10 numbers");

int i,j;

int arr[]=new int[10];

for(i=0;i<10;i++)

arr[i]=sc.nextInt();
 for(j=1;j<3;j++)

{ System.out.println("Now enter number to be searched");

int n=sc.nextInt();

int mid=0,beg=0,last=arr.length,flag=0;

while(beg<=last))

{ mid=(beg+last)/2;

if(arr[mid]==n)

{ flag=1;

break;

if(n>arr)

beg=mid+1;

if(n<arr[mid])

last=mid-1;

if(flag==1)

System.out.println("Element found @ "+mid);

else

System.out.println("Element not found");

5
import java.util.Scanner;

class Linear_search

{ public static void main(String args[])

{ Scanner sc=new Scanner(System.in);

System.out.println("Enter length of Array");

int len=sc.nextInt(),i,flag=0;

int a[]=new int[len];

int n=sc.nextInt();

for(i=0;i<len;i++)

{ if(i%2==0)

a[i]=i+2;

else

a[i]=i+3;

for(i=0;i<len;i++)

{ if(n==a[i])

flag++;

if(flag>0&&a[i]==n)

System.out.println("Element found @ "+i);

6
import java.util.*;

class Merging_array

{ public static void main(String args[])

{ Scanner sc=new Scanner(System.in);

System.out.println("Enter the length of 1st Array");

int a[]=new int[aa], aa=sc.nextInt();

System.out.println("Enter the length of 2nd Array");

int b[]=new int[bb], bb=sc.nextInt(),temp,i;

int c[]=new int[(aa+bb)];

{ if(i<aa)

a[i]=sc.nextInt();

else

{ temp=i-aa;

b[temp]=sc.nextInt(); }

for(i=0;i<(aa+bb);i++)

{ if(i<aa)

c[i]=a[i];

if(i>=aa)

{ temp=i-aa;

c[i]=b[temp];

} }

System.out.println("New Array is...");

for(i=0;i<(aa+bb);i++)

System.out.println("Number @ index "+i+" is "+c[i]);

} }

7
import java.util.*;
class Fibonacci_series
{ public static void main(String args[])
{ Scanner sc=new Scanner(System.in);
int a=1;
int b=1;
 int n=sc.nextInt();
System.out.print(a+" ");
System.out.print(b+" ");
for(int i=1;i<n;i++)
{ int c=a+b;
System.out.print(c+" ");
a=b;
b=c;
}
}
}

8
import java.util.*;
class Series_1
{
public static void main (String args[])
{
Scanner sc=new Scanner(System.in);
 int n=sc.nextInt();
int a=1,i;
for(i=1;i<=n;i++)
{
System.out.print(a+" ");
a=a+3;
}
}
}

9
import java.util.*;
class Series_2
{
public static void main(String args[])
{
Scanner sc=new Scanner(System.in);
 int n=sc.nextInt(),a=1;
for(int i=1;i<=n;i++)
{
a=( 4 * a )+1;
System.out.print(a+" ");
}
}
}

10
import java.util.*;
class Series_3
{
public static void main(String args[])
{
Scanner sc=new Scanner(System.in);
int n=sc.nextInt(),a=1;
 double num=0;
do
{
num=Math.pow(2,a)-1;
System.out.print(num+" ");
a++;
}
while(num<n);
}
}

11
import java.util.*;
class Series_4
{ public static void main(String args[])
{ Scanner sc=new Scanner(System.in);
int n=sc.nextInt();
int i,num;
System.out.println();
for(i=1;i<=n;i++)
 {
num=(3*i)+2;
if(num%4==0)
{
break;
}
System.out.print(num+" ");
}
}
}

12
import java.util.*;
class Series_5
{
public static void main(String args[])
{
Scanner sc=new Scanner(System.in);
int num,i,n=sc.nextInt();
for(i=1;i<=n;i++)
 {
num=i*i;
if(num%2==0&&num%3==0&&num%4==0)
{
break;
}
System.out.print(num+" ");
}
}
}

13
import java.util.*;
class Series_6
{
public static void main(String args[])
{
Scanner sc=new Scanner(System.in);
int n=sc.nextInt();
int num,i;
 for(i=1;i<=n;i++)
{
num=5*i+2;
if(num%3!=0)
{
System.out.print(num+" ");
}
}
}

14
import java.util.*;

class Automorphic_num

{ public static void main(String args[])

{ Scanner sc=new Scanner(System.in);

System.out.println("Enter a Num to check an Automorphic num ");

int n=sc.nextInt();

int num=n,m=n*n,count=0;

while(n!=0)

{ count++;
 n=n/10;

int ten=(int)Math.pow(10,count);

int rem=m%ten;

if(rem==m)

System.out.println("It is an Automorphic no ");

Else

System.out.println("It is not an Automorphic no ");

15
import java.util.*;

class Special_number

{ public static void main(String args[])

{ Scanner sc=new Scanner(System.in);

System.out.print("Enter a Num to check SPECIAL Number = ");

int i,s=1,sum=0,rem,n1=n, n=sc.nextInt();;

while(n1!=0)

{ rem=n%10;

for(i=1;i<=rem;i++)
 { s=s*i;

sum=sum+rem;

n=n/10;

System.out.println();

if(sum==n1)

System.out.println("Wow!! It's a SPECIAL Number ");

else

System.out.println("Sorry!! The Number is not a SPECIAL Number");

16
import java.util.*;
class Perfect_num
{
public static void main(String args[])
{ Scanner sc=new Scanner(System.in);
System.out.println("Enter a Num ");
int n=sc.nextInt();
int i,sum=0;
 for(i=1;i<n;i++)
{ if(n%i==0)
sum=sum+i;
}
if(sum==n)
System.out.println("It is an Perfect no ");
else
System.out.println("It's not a Perfect no ");
}
}

17
import java.util.*;

class buzz_num

public static void main(String args[])

Scanner sc=new Scanner(System.in);

System.out.println("Enter a number ");

int n=sc.nextInt();

if(n%10==7||n%7==0)
 {

System.out.println(n+" It's a Buzz number ");

else

System.out.println(n+" It's not a Buzz number");

}
 18
import java.util.*;
class Palindrome_num
{
public static void main(String args[])
{
Scanner sc=new Scanner(System.in);
System.out.println("Enter a Number");
int n=sc.nextInt(),n1=n, pal=0,rem;
while(n!=0)
{ rem=n%10;
pal=(pal*10)+rem;
n=n/10;
}
if(pal==n1)
System.out.println(n1+" It is a Palindrome number ");
else
System.out.println(n1+" It's not a Palindrome nnumber");
}
}
 19
import java.util.*;
class Neon_num
{ public static void main(String args[])
{ Scanner sc=new Scanner(System.in);
System.out.println("Enter a Num to check a Neon number ");
int n=sc.nextInt();
int n1=n*n,rem;
int i,sum=0;
while(n1!=0)
{ rem=n1%10;
sum=sum+rem;
n1=n1/10;
}
if(sum==n)
System.out.println("It is a Neon no ");
else
System.out.println("It's not a Neon no ");
}
}
 20
import java.util.*;
class Prime_num
{ public static void main(String args[])
{ Scanner sc=new Scanner(System.in);
System.out.println("Enter a Number ");
int i,count=0, n=sc.nextInt();
for(i=1;i<=n;i++)
{ if(n%i==0)
count++;
}
if(count==2)
System.out.println("It is an Prime no ");
else
System.out.println("It's not a Prime no");
}
}
 21
import java.io.*;

import java.util.*;

class HCF_of_2_Numbers

{ public static void main(String args[])throws IOException

Scanner sc=new Scanner(System.in);

int a=sc.nextInt(),rem=1;

int b=sc.nextInt(),temp;

if(a<b)

temp=b;

b=a;

a=temp;

System.out.print(a);

while(rem!=0)

rem=a/b;

rem=b/rem;

System.out.println(b);

}
 22
import java.util.*;

class Twisted_Prime_num

{ public static void main(String args[])

{ Scanner sc=new Scanner(System.in);

System.out.println("Enter a Num to check Twisted Prime num ");

int n2=0,count=0,count1=0, n=sc.nextInt(),num=n,i,j;

while(num!=0)

{ int rem=num%10;

n2=(n2*10)+rem;

for(i=2;i<n;i++)

if(n%i==0)

count++;

for(j=2;j<n2;j++)

{ if(n2%i==0)

count1++;

if(count==0&&count1==0)

System.out.println("It is an Twisted Prime no ");

else

System.out.println("It's not a Twisted Prime no");

}
 23
import java.util.*;

class Factor_Of_Num

public static void main(String args[])

Scanner sc=new Scanner(System.in);

System.out.print("Enter a Num to find Factors = ");

int n=sc.nextInt(),i,s=0;

System.out.println("These are the Factors of given Number :- ");

for(i=1;i<=n;i++)

{ if(n%i==0)

{ s++;

System.out.print(" "+i);

if(s==2)

System.out.println("Wow!! It's a PRIME Number with only (2) Factors");

else

System.out.println("The Number has "+s+" Factor(s)");

}
 24
import java.util.*;

class Count_Sum_Product_Count_Odd_Count_Even_and_their_Sum_of_digits_Reverse

public static void main(String args[])

Scanner sc=new Scanner(System.in);

System.out.println("Enter a number ");

int n=sc.nextInt();

int rem,count=0,sum=0,pr=1,sum1=0,sum2=0,c2=0,c3=0,rev=0;

while(n!=0)

{ rem=n%10;

count++;

sum=sum+rem;

pr=pr*rem;

rev=(rev*10)+rem;

if(rem%2==0)

{ sum1=sum1+rem;

c2++;

else

{ sum2=sum2+rem;

c3++;

n=n/10;

System.out.println("No of digits is "+count);

System.out.println();
 System.out.println("Sum of digits is "+sum);

System.out.println();

System.out.println("Product of digits is "+pr);

System.out.println();

System.out.println("No of even digits is "+c2);

System.out.println("Sum of even digits is "+sum1);

System.out.println();

System.out.println("No of odd digits is "+c3);

System.out.println("Sum of odd digits is "+sum2);

System.out.println();

System.out.println("Reverse of the Number is "+rev);

}
 25
import java.util.*;

class Magic_num

{ public static void main(String args[])

{ Scanner sc=new Scanner(System.in);

System.out.println("Enter a Num to check a Magic number ");

int n=sc.nextInt(),rem,magic=0, i,sum=0,c=0,sum1=0;

while(n!=0)

{ rem=n%10;

sum1=sum;

while(sum!=0)

c++;

if(c>1)

{ while(sum1!=0)

{ rem=sum1%10;

magic=magic+rem;

if(magic==1)

System.out.println("It's a Magic no");

else if (c==1)

if(sum==1)

System.out.println("It's a Magic no");

else

System.out.println("It's not a Magic No");

}
 26
import java.util.*;

class Armstrong_num

public static void main(String args[])

Scanner sc=new Scanner(System.in);

System.out.println("Enter a Num to check a Armstrong number ");

int n=sc.nextInt();

int n1=n,rem;

int i,sum=0;

while(n!=0)

rem=n%10;

sum=sum+(rem*rem*rem);

n=n/10;

if(sum==n1)

System.out.println("It is an Armstrong no ");

else

System.out.println("It's not a Armstrong no ");

}
 27
import java.util.*;

class Twin_prime_number

{ public static void main(String args[])

{ Scanner sc=new Scanner(System.in);

int n=sc.nextInt();

int n1=sc.nextInt();

int d=Math.abs(n-n1);

int i,count=0,count1=0;

for(i=2;i<n;i++)

{ if(i%n==0)

{ count++;

for(i=2;i<n1;i++)

{ if(i%n1==0)

{ count1++;

if(d==2&&count==0&&count1==0)

System.out.println("They are twin prime number");

else

System.out.println("It's not a twin prime number");

}
 28
import java.util.*;

class Min_Max_digit_in_number

{ public static void main(String args[])

{ Scanner sc=new Scanner(System.in);

System.out.println("Enter a number to find min & max");

int num=sc.nextInt(),rem,small=5,big=0,small1=0;

while(num!=0)

{ rem=num%10;

if(rem>big)

big=rem;

else if(rem==0)

small=rem;

else

small1=rem;

num=num/10; }

System.out.println("Biggest digit is "+big);

if(small==0)

System.out.println("Smallset number is "+small);

else

System.out.println("Smallest digit is "+small1);

}
 29
import java.util.*;

class Fibonacci_series

public static void main(String args[])

Scanner sc=new Scanner(System.in);

int a=1;

int b=1;

int n=sc.nextInt();

System.out.print(a+" ");

System.out.print(b+" ");

for(int i=1;i<n;i++)

int c=a+b;

System.out.print(c+" ");

a=b;

b=c;

}
 30
import java.util.*;
class Series_1
{
public static void main (String args[])
{
Scanner sc=new Scanner(System.in);
int n=sc.nextInt();
int a=1,i;
for(i=1;i<=n;i++)
{
System.out.print(a+" ");
a=a+3;
}
}
}
 31
import java.util.*;

class Series_2

public static void main(String args[])

Scanner sc=new Scanner(System.in);

int n=sc.nextInt(),a=1;

for(int i=1;i<=n;i++)

a=( 4 * a )+1;

System.out.print(a+" ");

}
 32
import java.util.*;
class Series_3
{
public static void main(String args[])
{
Scanner sc=new Scanner(System.in);
int n=sc.nextInt(),a=1;
double num=0;
do
{
num=Math.pow(2,a)-1;
System.out.print(num+" ");
a++;
}
while(num<n);
}
}
 33
import java.util.*;
class Series_4
{
public static void main(String args[])
{
Scanner sc=new Scanner(System.in);
int n=sc.nextInt();
int i,num;
System.out.println();
for(i=1;i<=n;i++)
{
num=(3*i)+2;
if(num%4==0)
{
break;
}
System.out.print(num+" ");
}
}
}
 34
import java.util.*;
class Series_5
{
public static void main(String args[])
{
Scanner sc=new Scanner(System.in);
int num,i,n=sc.nextInt();
for(i=1;i<=n;i++)
{
num=i*i;
if(num%2==0&&num%3==0&&num%4==0)
{
break;
}
System.out.print(num+" ");
}
}
}
 35
import java.util.*;
class Series_6
{
public static void main(String args[])
{
Scanner sc=new Scanner(System.in);
int n=sc.nextInt();
int num,i;
for(i=1;i<=n;i++)
{
num=5*i+2;
if(num%3!=0)
{
System.out.print(num+" ");
}
}
}
}
 36
import java.util.*;

class Character_count

{ public static void main(String args[])

{ Scanner sc=new Scanner(System.in);

String s=sc.nextLine();

s=s.toUpperCase();

int len=s.length(),count=0,i;

char c=' ',x=' ';

for(x='A';x<='Z';x++)

for(i=0;i<len;i++)

c=s.charAt(i);

if(c==x)

count++;

if(count>0)

System.out.println("Frequency of "+x+" is "+count);

count=0;

}
 37
import java.util.*;

class Count_Replace_vowels

{ public static void main(String args[])

Scanner sc=new Scanner(System.in);

String s=sc.nextLine().toUpperCase(),str1="",str2="";

int len=s.length(),i,count=0;

char c=' ',ch=' ';

for(i=0;i<len;i++)

c=s.charAt(i);

if(c=='A'||c=='E'||c=='I'||c=='O'||c=='U')

str1=str1+'*';

ch=c;

ch++;

count++;

str2=str2+ch;

else

str1=str1+c;

str2=str2+c;

System.out.println("Replaced vowels with '*' done- "+str1);

System.out.println();

System.out.println("Replaced vowels with succesor letter done- "+str2);

System.out.println();

System.out.println("Number of vowels in the String is "+count);

}
 38
import java.util.*;
class Piglatin_string
{
public static void main(String args[])
{
Scanner sc=new Scanner(System.in);
String s=' '+sc.nextLine();
int len=s.length(),i;
char c=' ',ch=' ';
for(i=0;i<len;i++)
{
c=s.charAt(i);
ch=s.charAt(i+1);
if(c==' ')
{
s=s.substring((i+2))+ch+"ay";
break;
}
}
System.out.println("Piglatin String is "+s);
}
}
 39
import java.util.*;
class Words_count
{
public static void main(String args[])
{
Scanner sc=new Scanner(System.in);
String s=' '+sc.nextLine();
int i,len=s.length(),count=0;
char c=' ';
for(i=0;i<len;i++)
{
c=s.charAt(i);
if(c==' ')
{
count++;
}
}
System.out.println("Number of Words in the String is
"+count);
}
}
 40
import java.util.*;

class String_lower_to_upper_interchange

{ public static void main(String args[])

{ Scanner sc=new Scanner(System.in);

String s=sc.nextLine(),str="";

int len=s.length(),i;

char c=' ',ch=' ';

for(i=0;i<len;i++)

{ c=s.charAt(i);

if(c!=' ')

{ if(c>='A'&&c<='Z')

{ ch=Character.toLowerCase(c);

str=str+ch;

if(c>='a'&&c<='z')

{ ch=Character.toUpperCase(c);

str=str+ch;

if(c==' ')

str=str+" ";

System.out.println(str);

}
 41
import java.util.*;
class Special_word
{
public static void main(String args[])
{
Scanner sc=new Scanner(System.in);
String s=sc.nextLine().toUpperCase();
if(s.charAt(0)==s.charAt(s.length()-1))
{
System.out.println(" ' "+s+" ' "+" is a Special word.");
}
else
{
System.out.println(" ' "+s+" ' "+" is not a Special word.");
}
}
}
 42
import java.util.*;
class Palindrome_and_Reversed_string
{ public static void main(String args[])
{ Scanner sc=new Scanner(System.in);
String s=sc.nextLine().toUpperCase(),str="";
int len=s.length(),i;
char c=' ';
for(i=0;i<len;i++)
{ c=s.charAt(i);
str=c+str;
}
if(str.equals(s))
System.out.println("It's a Palindrome String");
else
System.out.println("It's not a Palindrme String");
System.out.println();
System.out.println(" Reversed String is "+str);
}
}
 43
import java.util.*;
class Abbreviation_of_String
{
public static void main(String args[])
{
Scanner sc=new Scanner(System.in);
String s=' '+sc.nextLine().toUpperCase(),str="";
int i,len=s.length();
char c=' ',ch=' ';
for(i=0;i<len;i++)
{
c=s.charAt(i);
if(c==' ')
{
ch=s.charAt(i+1);
str=str+" "+ch;
}
}
System.out.println("Abbreviated String is '"+str+" '");
}
}
 44
import java.util.*;
class Word_reverse
{
public static void main(String args[])
{
Scanner sc=new Scanner(System.in);
String s=sc.nextLine()+' ',str="",word="";
int x=0,i,len=s.length();
for(i=0;i<len;i++)
{
char c=s.charAt(i);
if(c==' ')
{
word=s.substring(x,(i+1));
x=i+1;
str=word+str;
}
}
System.out.println(" "+str);
}
}
 45
import java.util.*;

class Short_form

{ public static void main(String args[])

{ Scanner sc=new Scanner(System.in);

String s=' '+sc.nextLine(),str="";

int len=s.length(),i,count=0,count2=0,loop=0;

char c=' ',ch=' ';

for(i=0;i<len;i++)

{ c=s.charAt(i);

if(c==' ')

count++; }

for(i=0;i<len;i++)

{ loop++;

c=s.charAt(i);

if(c==' ')

{ count2++;

if(count>count2)

{ ch=s.charAt((i+1));

str=str+ch+"."; }

else

str=str+c;

System.out.println(" "+str);

} }
 46
import java.util.*;
class Pattern_1
{ public static void main(String args[])
{ Scanner sc=new Scanner(System.in);
String s=sc.nextLine();
int len=s.length(),i,j;
char ch=' ',c=' ';
for(i=0;i<len;i++)
{ for(j=0;j<len;j++)
{ if(s.charAt(j)==s.charAt(i))
{ ch=Character.toUpperCase(s.charAt(j));
System.out.print(ch);
}
else
{
System.out.print(s.charAt(j));
}
}
System.out.println();
}
}
}
 47
import java.util.*;
class Pattern_2
{
public static void main(String args[])
{
Scanner sc=new Scanner(System.in);
String s=sc.nextLine();
int len=s.length(),i,j;
char ch=' ',c=' ';
for(i=0;i<len;i++)
{
for(j=(len-1);j>=i;j--)
{
System.out.print(s.charAt(j));
}
System.out.println();
}
}
}
 48
import java.util.*;
class Pattern_2
{ public static void main(String args[])
{
Scanner sc=new Scanner(System.in);
String s=sc.nextLine();
int len=s.length(),i,j,sp=(len-1),spa;
char ch=' ',c=' ';
for(i=0;i<len;i++)
{
for(spa=sp;spa>i;spa--)
{ System.out.print(" ");
}
for(j=0;j<=i;j++)
{
System.out.print(s.charAt(j));
}
System.out.println();
}
}
}
 49
import java.util.*;
class Pattern_3
{
public static void main(String args[])
{
Scanner sc=new Scanner(System.in);
String s=sc.nextLine();
int len=s.length(),i,j,sp=(len-1),spa;
char ch=' ',c=' ';
for(i=0;i<len;i++)
{
for(spa=sp;spa>i;spa--)
{ System.out.print(" ");
}
for(j=0;j<=i;j++)
{
System.out.print(s.charAt(j));
}
System.out.println();
}
}
}
 50
import java.util.*;
class Pattern_4
{
public static void main(String args[])
{
Scanner sc=new Scanner(System.in);
String s=sc.nextLine();
int len=s.length(),i,j,sp=(len-1),spa;
char ch=' ',c=' ';
for(i=0;i<len;i++)
{
for(j=0;j<=i;j++)
{
System.out.print(s.charAt(j));
}
System.out.println();
}
}
}