• Number of even numbers in given 5

public static void main(String[] args)

{
Scanner sc=new Scanner(System.in);
System.out.println("Enter numbers");
int Ip1=sc.nextInt();
int Ip2=sc.nextInt();
int Ip3=sc.nextInt();
int Ip4=sc.nextInt();
int Ip5=sc.nextInt();
System.out.println(EvenIn5(Ip1,Ip2,Ip3,Ip4,Ip5));

}
public static int EvenIn5(int Ip1,int Ip2,int Ip3,int Ip4,int Ip5)
{
int arr[]= {Ip1,Ip2,Ip3,Ip4,Ip5};
int count=0;
for(int i=0;i<5;i++)
{]\\\
if(arr[i]%2==0)
count++;
}
return count;
}

2.Is input2 exact multiple of input1

public static void main(String[] args) {

Scanner sc=new Scanner(System.in);
System.out.println("Enter numbers");
int input1=sc.nextInt();
int input2=sc.nextInt();
System.out.println(ExactMultiple(input1,input2));

}
public static int ExactMultiple(int input1,int input2)
{
if(input1%input2==0)
{
return 1;
}
else
return 2;
}

3.Is given number even?

public static void main(String[] args)
{
Scanner sc=new Scanner(System.in);
System.out.println("Enter the number");
int input1=sc.nextInt();
System.out.println(isEven(input1));
}
public static int isEven(int input1)
{
if(input1%2==0)
return 2;
else
return 1;
}

4. Is given number odd?

public static void main(String [] args)
{
Scanner sc=new Scanner(System.in);
System.out.println("Enter the number");
int input1=sc.nextInt();
System.out.println(isOdd(input1));

}
public static int isOdd(int input1)
{
if(input1%2!=0)
return 2;
else
return 1;
}

5.Is given number prime?

public static void main(String[] args) {
Scanner sc=new Scanner(System.in);
System.out.println("Enter the number");
int input1=sc.nextInt();
System.out.println(IsPrime(input1));

}
public static int IsPrime(int input1)
{
int count=0;
if(input1%2==0)
count++;
if(count==0)
return 2;
return 1;
}
6. Print the last digit of given number
public static void main(String[] args) {
Scanner sc=new Scanner(System.in);
System.out.println("Enter the number");
int input1=sc.nextInt();
System.out.println(LastDigit(input1));
}
public static int LastDigit(int input1)
{
return Math.abs(input1%10);
}
7.number of odd in given 5
public static void main(String[] args)
{
Scanner sc=new Scanner(System.in);
System.out.println("Enter numbers");
int Ip1=sc.nextInt();
int Ip2=sc.nextInt();
int Ip3=sc.nextInt();
int Ip4=sc.nextInt();
int Ip5=sc.nextInt();
System.out.println(EvenIn5(Ip1,Ip2,Ip3,Ip4,Ip5));

}
public static int EvenIn5(int Ip1,int Ip2,int Ip3,int Ip4,int Ip5)
{
int arr[]= {Ip1,Ip2,Ip3,Ip4,Ip5};
int count1=0;
for(int i=0;i<5;i++)
{
if(arr[i]%2!=0)
count1++;
}
return count1;
}
8.Print number of odd or even based on the last string input
public static void main(String[] args)
{
Scanner sc=new Scanner(System.in);
System.out.println("Enter numbers");
int Ip1=sc.nextInt();
int Ip2=sc.nextInt();
int Ip3=sc.nextInt();
int Ip4=sc.nextInt();
int Ip5=sc.nextInt();
String ip6=sc.next();
System.out.println(EvenIn5(Ip1,Ip2,Ip3,Ip4,Ip5, ip6));

}
public static int EvenIn5(int Ip1,int Ip2,int Ip3,int Ip4,int Ip5,String Ip6)
{
int arr[]= {Ip1,Ip2,Ip3,Ip4,Ip5};
int count1=0;
int count2=0;
for(int i=0;i<5;i++)
{
if(arr[i]%2==0)
count1++;
else
count2++;
}
if(Ip6.equals("Even"))
return count1;
return count2;
}
9.Print second last digit of input
public class SecondLDigit {

public static void main(String[] args) {

Scanner sc=new Scanner(System.in);
System.out.println("Enter the number");
int input1=sc.nextInt();
System.out.println(SecondLast(input1));

}
public static int SecondLast(int input1)
{
int a,b;
a=input1/10;
b=a%10;
return b;
}
10. Sum of last digits of two numbers
Public static void main(String[] args) {
Scanner sc=new Scanner(System.in);
System.out.println("ENter the numbers");
int input1=sc.nextInt();
int input2=sc.nextInt();
System.out.println(SumofLast(input1,input2));

}
public static int SumofLast(int input1,int input2)
{
int a,b;
a=input1%10;
b=input2%10;
return a+b;
}
11.Sum of all digits in n
public static void main(String[] args) {
// TODO Auto-generated method stub
Scanner sc=new Scanner(System.in);
System.out.println("Enter the number");
int n=sc.nextInt();
System.out.println(alldigitcount(n));
}

private static int alldigitcount(int input1) {

// TODO Auto-generated method stub
int count=0;
while(input1>0)
{
count++;
input1/=10;
}
return count;
}
 12.Factorial of n

Scanner sc=new Scanner(System.in);

System.out.println("Enter the number");
int input1=sc.nextInt();
System.out.println(factorial(input1));
}

private static int factorial(int input1) {

// TODO Auto-generated method stub
int fact=1;
for(int i=1;i<=input1;i++)
fact=fact*i;
return fact;
}
13. n th number in Fibonacci series
public static void main(String[] args) {
// TODO Auto-generated method stub
Scanner sc=new Scanner(System.in);
System.out.println("Enter the number");
int input1=sc.nextInt();
System.out.println(fibonacci(input1));
}

private static int fibonacci(int input1) {

// TODO Auto-generated method stub
int a=0,b=1,c=0;
if(input1==1)
return 1;
else
for(int i=2;i<input1;i++)
{
c=a+b;
a=b;
b=c;
}
return b;
}
15. Non repeated digit count //input:292 Output:1(9)
public static void main(String[] args) {
// TODO Auto-generated method stub
Scanner sc=new Scanner(System.in);
System.out.println("Enter the number");
int n=sc.nextInt();
System.out.println(nonrepeatedcount(n));

private static int nonrepeatedcount(int input1) {

// TODO Auto-generated method stub
int count=0,count1=0;
 String s=Integer.toString(input1);
for(int i=0;i<s.length();i++)
{
count=0;
for(int j=0;j<s.length();j++)
{
if(s.charAt(i)==s.charAt(j))
count++;
}
if(count==1)
count1++;
}
return count1;
}
16.N th prime number
public static void main(String[] args) {
// TODO Auto-generated method stub
Scanner sc=new Scanner(System.in);
System.out.println("Enter the number");
int n=sc.nextInt();
System.out.println(nThPrime(n));
}

private static int nThPrime(int input1) {

// TODO Auto-generated method stub
int count=2,term=0,count1=0,temp=0;
while(term!=input1)
{
count1=0;
for(int i=2;i<=count;i++)
{
if(count%i==0)
count1++;
}
if(count1==1)
{
temp=count;
term++;
}
count++;

}
return temp;
}
17.Number of prime numbers between given range
public static void main(String[] args) {
// TODO Auto-generated method stub
Scanner sc=new Scanner(System.in);
int input1=sc.nextInt();
int input2=sc.nextInt();
System.out.println(coutnPrimesInRange(input1,input2));
}
 private static int coutnPrimesInRange(int input1, int input2) {
// TODO Auto-generated method stub
int count=0,term=0;
for(int i=input1;i<=input2;i++)
{
int count1=0;
for(int j=2;j<=i;j++)
{
if(i%j==0)
count1++;
}
if(count1==1)
{
term++;
}
count++;

}
return term;
}
18.Sum of all digits in N until sum become single digit
public static void main(String[] args) {
// TODO Auto-generated method stub
Scanner sc=new Scanner(System.in);
int n=sc.nextInt();
System.out.println(digitSum(n));
}

private static int digitSum(int input1) {

// TODO Auto-generated method stub
int temp,sum=0,i=input1;
input1=Math.abs(input1);
String s="";
while(input1>0)
{
sum=sum+input1%10;
input1=input1/10;
if(sum>9 && input1==0)
{
input1=sum;
sum=0;
}
}
if(i>0)
return sum;
return sum*-1;

}
19. Sum of even numbers in first 5 numbers
public static void main(String[] args) {
// TODO Auto-generated method stub
Scanner sc=new Scanner(System.in);
int n=sc.nextInt();
 System.out.println(EvenSum(n));
}

private static int EvenSum(int input1) {

// TODO Auto-generated method stub
int temp=0,sum=0;
while(input1>0)
{
temp=input1%10;
if(temp%2==0)
sum=sum+temp;
input1/=10;
}
return sum;
}
20. Sum of odd numbers in first 5 numbers
public static void main(String[] args) {
// TODO Auto-generated method stub
Scanner sc=new Scanner(System.in);
int n=sc.nextInt();
System.out.println(OddSum(n));
}

private static int OddSum(int input1) {

// TODO Auto-generated method stub
int temp=0,sum=0;
while(input1>0)
{
temp=input1%10;
if(temp%2!=0)
sum=sum+temp;
input1/=10;
}
return sum;
}
21.Sum of odd or even in given numbers based on input2
public static void main(String[] args) {
// TODO Auto-generated method stub
Scanner sc=new Scanner(System.in);
int n=sc.nextInt();
String s=sc.next();
System.out.println(OddSum(n,s));
}

private static int OddSum(int input1, String input2) {

// TODO Auto-generated method stub
int temp=0,sum1=0,sum2=0;
while(input1>0)
{
temp=input1%10;
if(temp%2!=0)
sum1=sum1+temp;
else
sum2=sum2+temp;
 input1/=10;
}
if(input2.contentEquals("odd"))
return sum1;
return sum2;
}

22. Unique digits count //input:292 output:2(2&9)

public static void main(String[] args) {
// TODO Auto-generated method stub
Scanner sc=new Scanner(System.in);
System.out.println("Enter the number");
int n=sc.nextInt();
System.out.println(uniquedigitcount(n));

private static int uniquedigitcount(int input1) {

// TODO Auto-generated method stub
String s=Integer.toString(input1);
int arr[]=new int[s.length()];
int i=0,count=0,count1=0;
while(input1>0)
{
arr[i]=input1%10;
input1/=10;
i++;
}

for(int j=0;j<arr.length;j++)
{
count=0;
for(int k=j;k>=0;k--)
{
if(arr[j]==arr[k])
count++;
}
if(count==1)
count1++;
}
return count1;
}
23. Frequently repeated characters
public static void main(String[] args) {
// TODO Auto-generated method stub
Scanner sc=new Scanner(System.in);
int input1=sc.nextInt();
int input2=sc.nextInt();
int input3=sc.nextInt();
int input4=sc.nextInt();
System.out.println(MostFrequentDigit(input1,input2,input3,input4));
 }

private static int MostFrequentDigit(int input1, int input2, int input3, int
input4) {
// TODO Auto-generated method stub
String s=input1+""+input2+""+input3+""+input4;
int count=0,max=0;
int c=1,a=1;
for(int i=0;i<s.length();i++)
{
count=0;
for(int j=0;j<s.length();j++)
{
if(s.charAt(i)==s.charAt(j))
count++;
}
if(count>max)
{
max=count;
c=Integer.parseInt(String.valueOf(s.charAt(i)));
}
if(count==max)
{
a=Integer.parseInt(String.valueOf(s.charAt(i)));
if(a>c)
c=a;
}
}
return (c);
}
24.Hill weight
public static void main(String[] args) {
// TODO Auto-generated method stub
Scanner sc=new Scanner(System.in);
System.out.println("Enter total level");
int input1=sc.nextInt();
System.out.println("Enter top level");
int input2=sc.nextInt();
System.out.println("Enter subsequent level");
int input3=sc.nextInt();
System.out.println(totalHillWeight(input1,input2,input3));
}

private static int totalHillWeight(int input1, int input2, int input3) {

// TODO Auto-generated method stub
int total=input2;
for(int i=2;i<=input1;i++)
{
input2=input3+input2;
total=total+(i*(input2));
}
return total;
}
25.Is given number palindrome
public static void main(String[] args) {
// TODO Auto-generated method stub
Scanner sc=new Scanner(System.in);
int n=sc.nextInt();
System.out.println(isPalindrome(n));
}

private static int isPalindrome(int n) {

// TODO Auto-generated method stub
String s=Integer.toString(n);
StringBuffer sb=new StringBuffer(s);
sb.reverse();
if(s.contentEquals(sb))
return 2;
return 1;

}
26.Is given string is palindrome
public static void main(String[] args) {
// TODO Auto-generated method stub
Scanner sc=new Scanner(System.in);
String s=sc.next();
System.out.println(isPalindrome(s));
}

private static int isPalindrome(String input1) {

// TODO Auto-generated method stub
input1=input1.toLowerCase();
StringBuffer sb=new StringBuffer(input1);
sb.reverse();
if(input1.equals(sb.toString()))
return 2;
return 1;
}
27. Pin generation
public static void main(String[] args) {
// TODO Auto-generated method stub
Scanner sc=new Scanner(System.in);
int input1=sc.nextInt();
int input2=sc.nextInt();
int input3=sc.nextInt();
System.out.println(pin(input1,input2,input3));

}
private static int pin(int input1, int input2, int input3) {
// TODO Auto-generated method stub
int []arr=new int[3];
int []brr=new int[3];
int []crr=new int[3];
for(int i=0;i<arr.length;i++)
{
arr[i]=input1%10;
input1/=10;
 //System.out.println(arr[i]);
}
for(int i=0;i<brr.length;i++)
{
brr[i]=input2%10;
input2/=10;
}
for(int i=0;i<crr.length;i++)
{
crr[i]=input3%10;
input3/=10;
}
int ones[]={arr[2],brr[2],crr[2]};
int tens[]={arr[1],brr[1],crr[1]};
int hundr[]={arr[0],brr[0],crr[0]};
Arrays.sort(ones);
Arrays.sort(tens);
Arrays.sort(hundr);
int max=0;
if(ones[2]>=tens[2]&&ones[2]>=hundr[2])
{
max=ones[2];
}
else if(tens[2]>=ones[2]&&tens[2]>=hundr[2])
{
max=tens[2];
}
else
{
max=hundr[2];
}
String pin="";
pin=ones[0]+pin;
pin=tens[0]+pin;
pin=hundr[0]+pin;
pin=max+pin;
return Integer.valueOf(pin);

}
28. Is palindrome possible after rearranging the digits of a number
public static void main(String[] args) {
// TODO Auto-generated method stub
Scanner sc=new Scanner(System.in);
int n=sc.nextInt();
System.out.println(posPol(n));
}
public static int posPol(int input1)
{
int input2=input1,input3=input1,count=0,count1=0,count2=0,length=0;
for(int i=input2%10;input2>0;input2/=10)
{
length++;
input3=input1;
count=0;
 while(input3>0)
{
if(i==input3%10)
count++;
input3/=10;
}
if(count%2==0)
count1++;
else if(count==1)
count2++;

}
if((count1==length||count1==length-1) && (count2==0||count2==1) && (input1/10!
=0))
return 2;
return 1;
}
29. Second word to upper case in the given sentence
public static void main(String[] args) {
// TODO Auto-generated method stub
Scanner sc=new Scanner(System.in);
String s=sc.nextLine();
System.out.println(wordToUpper(s));
}

private static String wordToUpper(String input1) {

// TODO Auto-generated method stub
String s[]=input1.split(" ");
if(s.length==1)
return "LESS";
return s[1].toUpperCase();
}
30.Weight of string
public static void main(String[] args) {
// TODO Auto-generated method stub
Scanner sc=new Scanner(System.in);
String s=sc.nextLine();
System.out.println("Enter the number");
int n1=sc.nextInt();
System.out.println("Enter the second input");
int n2=sc.nextInt();
s=s.toUpperCase();
int sum=0;
if(n1==0)
{
s=s.replaceAll("[AEIOU ]","");
}
if(n1==1)
{
s=s.replaceAll("[BCDFGHJKLMNPQRSTVWXYZ ]", "");
}
if(n2==0)
System.out.println(s.toLowerCase());
else
 System.out.println(s.toUpperCase());
}